searching the database
Your data matches 159 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St000717
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
([],2)
=> 1
([(0,1)],2)
=> 2
([],3)
=> 1
([(1,2)],3)
=> 1
([(0,1),(0,2)],3)
=> 2
([(0,2),(2,1)],3)
=> 3
([(0,2),(1,2)],3)
=> 2
([],4)
=> 1
([(2,3)],4)
=> 1
([(1,2),(1,3)],4)
=> 1
([(0,1),(0,2),(0,3)],4)
=> 2
([(0,2),(0,3),(3,1)],4)
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> 3
([(1,2),(2,3)],4)
=> 1
([(0,3),(3,1),(3,2)],4)
=> 3
([(1,3),(2,3)],4)
=> 1
([(0,3),(1,3),(3,2)],4)
=> 3
([(0,3),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2)],4)
=> 1
([(0,3),(1,2),(1,3)],4)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(0,3),(2,1),(3,2)],4)
=> 4
([(0,3),(1,2),(2,3)],4)
=> 2
([],5)
=> 1
([(3,4)],5)
=> 1
([(2,3),(2,4)],5)
=> 1
([(1,2),(1,3),(1,4)],5)
=> 1
([(0,1),(0,2),(0,3),(0,4)],5)
=> 2
([(0,2),(0,3),(0,4),(4,1)],5)
=> 2
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> 3
([(1,3),(1,4),(4,2)],5)
=> 1
([(0,3),(0,4),(4,1),(4,2)],5)
=> 2
([(1,2),(1,3),(2,4),(3,4)],5)
=> 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 4
([(0,3),(0,4),(3,2),(4,1)],5)
=> 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 3
([(2,3),(3,4)],5)
=> 1
([(1,4),(4,2),(4,3)],5)
=> 1
([(0,4),(4,1),(4,2),(4,3)],5)
=> 3
([(2,4),(3,4)],5)
=> 1
([(1,4),(2,4),(4,3)],5)
=> 1
([(0,4),(1,4),(4,2),(4,3)],5)
=> 3
([(1,4),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(2,4),(4,3)],5)
=> 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
([(0,4),(1,4),(2,3)],5)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 1
Description
The number of ordinal summands of a poset.
The ordinal sum of two posets $P$ and $Q$ is the poset having elements $(p,0)$ and $(q,1)$ for $p\in P$ and $q\in Q$, and relations $(a,0) < (b,0)$ if $a < b$ in $P$, $(a,1) < (b,1)$ if $a < b$ in $Q$, and $(a,0) < (b,1)$.
This statistic is the length of the longest ordinal decomposition of a poset.
Matching statistic: St000287
(load all 24 compositions to match this statistic)
(load all 24 compositions to match this statistic)
Values
([],2)
=> ([(0,1)],2)
=> 1
([(0,1)],2)
=> ([],2)
=> 2
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 1
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> 2
([(0,2),(2,1)],3)
=> ([],3)
=> 3
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 2
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,2),(1,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> 3
([(1,2),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> 3
([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> 3
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 1
([(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> 2
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 2
([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,2),(1,3),(1,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3
([(1,3),(1,4),(4,2)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> 4
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> 3
([(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3
([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> 3
([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 1
Description
The number of connected components of a graph.
Matching statistic: St000010
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00198: Posets —incomparability graph⟶ Graphs
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
St000010: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
St000010: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],2)
=> ([(0,1)],2)
=> [2]
=> 1
([(0,1)],2)
=> ([],2)
=> [1,1]
=> 2
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 1
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> [3]
=> 1
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> [2,1]
=> 2
([(0,2),(2,1)],3)
=> ([],3)
=> [1,1,1]
=> 3
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> [2,1]
=> 2
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 1
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 1
([(1,2),(1,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 1
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> 2
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> [3,1]
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> [2,1,1]
=> 3
([(1,2),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [4]
=> 1
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> [2,1,1]
=> 3
([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 1
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> [2,1,1]
=> 3
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> 2
([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> 1
([(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [4]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> [2,2]
=> 2
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> [1,1,1,1]
=> 4
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> [3,1]
=> 2
([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1
([(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1
([(1,2),(1,3),(1,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> 2
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> 2
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> 2
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> 3
([(1,3),(1,4),(4,2)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> 2
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> [2,1,1,1]
=> 4
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> [4,1]
=> 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> [4,1]
=> 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> [2,2,1]
=> 3
([(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1
([(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> 3
([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1
([(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> [2,2,1]
=> 3
([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> 2
([(0,4),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> 1
Description
The length of the partition.
Matching statistic: St000286
(load all 11 compositions to match this statistic)
(load all 11 compositions to match this statistic)
Values
([],2)
=> ([(0,1)],2)
=> ([],2)
=> 1
([(0,1)],2)
=> ([],2)
=> ([(0,1)],2)
=> 2
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 1
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 1
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 2
([(0,2),(2,1)],3)
=> ([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 2
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 1
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> 1
([(1,2),(1,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 1
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(1,2),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 1
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> 1
([(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],5)
=> 1
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(3,4)],5)
=> 1
([(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 1
([(1,2),(1,3),(1,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 1
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(1,3),(1,4),(4,2)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 3
([(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 1
([(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 1
([(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 3
([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
([(0,4),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 1
Description
The number of connected components of the complement of a graph.
The complement of a graph is the graph on the same vertex set with complementary edges.
Matching statistic: St000383
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00198: Posets —incomparability graph⟶ Graphs
Mp00152: Graphs —Laplacian multiplicities⟶ Integer compositions
St000383: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00152: Graphs —Laplacian multiplicities⟶ Integer compositions
St000383: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],2)
=> ([(0,1)],2)
=> [1,1] => 1
([(0,1)],2)
=> ([],2)
=> [2] => 2
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> [2,1] => 1
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> [1,1,1] => 1
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> [1,2] => 2
([(0,2),(2,1)],3)
=> ([],3)
=> [3] => 3
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> [1,2] => 2
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1] => 1
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => 1
([(1,2),(1,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => 1
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> [2,2] => 2
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> [1,1,2] => 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> [1,3] => 3
([(1,2),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [1,2,1] => 1
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> [1,3] => 3
([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => 1
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> [1,3] => 3
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> [2,2] => 2
([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> [1,2,1] => 1
([(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [1,1,1,1] => 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> [2,2] => 2
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> [4] => 4
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> [1,1,2] => 2
([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1] => 1
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 1
([(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => 1
([(1,2),(1,3),(1,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,2,1,1] => 1
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,2] => 2
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,2] => 2
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,2] => 2
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [2,3] => 3
([(1,3),(1,4),(4,2)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => 1
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,2] => 2
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,2,1] => 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> [1,4] => 4
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> [1,2,2] => 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> [1,1,1,2] => 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> [2,3] => 3
([(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => 1
([(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,2,1] => 1
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [2,3] => 3
([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => 1
([(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,2,1] => 1
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> [2,3] => 3
([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,2,1,1] => 1
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [2,3] => 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,2] => 2
([(0,4),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [1,1,1,1,1] => 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => 1
([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1,1] => 1
Description
The last part of an integer composition.
Matching statistic: St000544
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Values
([],2)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(0,1)],2)
=> ([],2)
=> ([],2)
=> 2
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> 2
([(0,2),(2,1)],3)
=> ([],3)
=> ([],3)
=> 3
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> 2
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,2),(1,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(2,3)],4)
=> 3
([(1,2),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> ([(2,3)],4)
=> 3
([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(2,3)],4)
=> 3
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> 2
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> ([],4)
=> 4
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,2),(1,3),(1,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3
([(1,3),(1,4),(4,2)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> ([(3,4)],5)
=> 4
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> 3
([(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3
([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> 3
([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
Description
The cop number of a graph.
This is the minimal number of cops needed to catch the robber. The algorithm is from [2].
Matching statistic: St000553
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Values
([],2)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(0,1)],2)
=> ([],2)
=> ([],2)
=> 2
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> 2
([(0,2),(2,1)],3)
=> ([],3)
=> ([],3)
=> 3
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> 2
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,2),(1,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(2,3)],4)
=> 3
([(1,2),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> ([(2,3)],4)
=> 3
([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(2,3)],4)
=> 3
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> 2
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> ([],4)
=> 4
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,2),(1,3),(1,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3
([(1,3),(1,4),(4,2)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> ([(3,4)],5)
=> 4
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> 3
([(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3
([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> 3
([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
Description
The number of blocks of a graph.
A cut vertex is a vertex whose deletion increases the number of connected components. A block is a maximal connected subgraph which itself has no cut vertices. Two distinct blocks cannot overlap in more than a single cut vertex.
Matching statistic: St001363
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Values
([],2)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(0,1)],2)
=> ([],2)
=> ([],2)
=> 2
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> 2
([(0,2),(2,1)],3)
=> ([],3)
=> ([],3)
=> 3
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> 2
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,2),(1,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(2,3)],4)
=> 3
([(1,2),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> ([(2,3)],4)
=> 3
([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(2,3)],4)
=> 3
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> 2
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> ([],4)
=> 4
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,2),(1,3),(1,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3
([(1,3),(1,4),(4,2)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> ([(3,4)],5)
=> 4
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> 3
([(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3
([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> 3
([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
Description
The Euler characteristic of a graph according to Knill.
This is $$\sum_{k\geq 1} (-1)^{k-1} c_k,$$
where $c_k$ is the number of cliques with $k$ vertices.
Matching statistic: St000147
Mp00198: Posets —incomparability graph⟶ Graphs
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
Mp00044: Integer partitions —conjugate⟶ Integer partitions
St000147: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
Mp00044: Integer partitions —conjugate⟶ Integer partitions
St000147: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],2)
=> ([(0,1)],2)
=> [2]
=> [1,1]
=> 1
([(0,1)],2)
=> ([],2)
=> [1,1]
=> [2]
=> 2
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,1,1]
=> 1
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> [3]
=> [1,1,1]
=> 1
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> [2,1]
=> [2,1]
=> 2
([(0,2),(2,1)],3)
=> ([],3)
=> [1,1,1]
=> [3]
=> 3
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> [2,1]
=> [2,1]
=> 2
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([(1,2),(1,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [2,1,1]
=> 2
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> [3,1]
=> [2,1,1]
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> [2,1,1]
=> [3,1]
=> 3
([(1,2),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> [2,1,1]
=> [3,1]
=> 3
([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> [2,1,1]
=> [3,1]
=> 3
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [2,1,1]
=> 2
([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> [2,2]
=> [2,2]
=> 2
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> [1,1,1,1]
=> [4]
=> 4
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> [3,1]
=> [2,1,1]
=> 2
([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(1,2),(1,3),(1,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> 2
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> 2
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> 2
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [3,1,1]
=> 3
([(1,3),(1,4),(4,2)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> 2
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> [2,1,1,1]
=> [4,1]
=> 4
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> [4,1]
=> [2,1,1,1]
=> 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> [2,2,1]
=> [3,2]
=> 3
([(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [3,1,1]
=> 3
([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> [2,2,1]
=> [3,2]
=> 3
([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [3,1,1]
=> 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> 2
([(0,4),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
Description
The largest part of an integer partition.
Matching statistic: St000273
Values
([],2)
=> ([(0,1)],2)
=> [1,1] => ([(0,1)],2)
=> 1
([(0,1)],2)
=> ([],2)
=> [2] => ([],2)
=> 2
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> [2,1] => ([(0,2),(1,2)],3)
=> 1
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> [1,2] => ([(1,2)],3)
=> 2
([(0,2),(2,1)],3)
=> ([],3)
=> [3] => ([],3)
=> 3
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> [1,2] => ([(1,2)],3)
=> 2
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,2),(1,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> [2,2] => ([(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> [1,3] => ([(2,3)],4)
=> 3
([(1,2),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> [1,3] => ([(2,3)],4)
=> 3
([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> [1,3] => ([(2,3)],4)
=> 3
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> [2,2] => ([(1,3),(2,3)],4)
=> 2
([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> [2,2] => ([(1,3),(2,3)],4)
=> 2
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> [4] => ([],4)
=> 4
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2
([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,2),(1,3),(1,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 2
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [2,3] => ([(2,4),(3,4)],5)
=> 3
([(1,3),(1,4),(4,2)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> [1,4] => ([(3,4)],5)
=> 4
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> [2,3] => ([(2,4),(3,4)],5)
=> 3
([(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [2,3] => ([(2,4),(3,4)],5)
=> 3
([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> [2,3] => ([(2,4),(3,4)],5)
=> 3
([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [2,3] => ([(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 2
([(0,4),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
Description
The domination number of a graph.
The domination number of a graph is given by the minimum size of a dominating set of vertices. A dominating set of vertices is a subset of the vertex set of such that every vertex is either in this subset or adjacent to an element of this subset.
The following 149 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000288The number of ones in a binary word. St000378The diagonal inversion number of an integer partition. St000382The first part of an integer composition. St000733The row containing the largest entry of a standard tableau. St000916The packing number of a graph. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001322The size of a minimal independent dominating set in a graph. St001339The irredundance number of a graph. St001829The common independence number of a graph. St000157The number of descents of a standard tableau. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St001828The Euler characteristic of a graph. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000460The hook length of the last cell along the main diagonal of an integer partition. St000870The product of the hook lengths of the diagonal cells in an integer partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001360The number of covering relations in Young's lattice below a partition. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001933The largest multiplicity of a part in an integer partition. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000068The number of minimal elements in a poset. St000181The number of connected components of the Hasse diagram for the poset. St000298The order dimension or Dushnik-Miller dimension of a poset. St000307The number of rowmotion orbits of a poset. St000527The width of the poset. St000528The height of a poset. St000907The number of maximal antichains of minimal length in a poset. St000908The length of the shortest maximal antichain in a poset. St000909The number of maximal chains of maximal size in a poset. St000911The number of maximal antichains of maximal size in a poset. St000912The number of maximal antichains in a poset. St001268The size of the largest ordinal summand in the poset. St001343The dimension of the reduced incidence algebra of a poset. St001399The distinguishing number of a poset. St001717The largest size of an interval in a poset. St001779The order of promotion on the set of linear extensions of a poset. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St000456The monochromatic index of a connected graph. St001592The maximal number of simple paths between any two different vertices of a graph. St000633The size of the automorphism group of a poset. St000640The rank of the largest boolean interval in a poset. St000910The number of maximal chains of minimal length in a poset. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St000668The least common multiple of the parts of the partition. St001571The Cartan determinant of the integer partition. St000259The diameter of a connected graph. St000260The radius of a connected graph. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001637The number of (upper) dissectors of a poset. St001668The number of points of the poset minus the width of the poset. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St000455The second largest eigenvalue of a graph if it is integral. St001570The minimal number of edges to add to make a graph Hamiltonian. St000100The number of linear extensions of a poset. St000914The sum of the values of the Möbius function of a poset. St001890The maximum magnitude of the Möbius function of a poset. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St000524The number of posets with the same order polynomial. St000525The number of posets with the same zeta polynomial. St000526The number of posets with combinatorially isomorphic order polytopes. St000906The length of the shortest maximal chain in a poset. St001280The number of parts of an integer partition that are at least two. St001924The number of cells in an integer partition whose arm and leg length coincide. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St000454The largest eigenvalue of a graph if it is integral. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001568The smallest positive integer that does not appear twice in the partition. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St000706The product of the factorials of the multiplicities of an integer partition. St000781The number of proper colouring schemes of a Ferrers diagram. St000993The multiplicity of the largest part of an integer partition. St001432The order dimension of the partition. St000667The greatest common divisor of the parts of the partition. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St001128The exponens consonantiae of a partition. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St001118The acyclic chromatic index of a graph. St001389The number of partitions of the same length below the given integer partition. St001527The cyclic permutation representation number of an integer partition. St001780The order of promotion on the set of standard tableaux of given shape. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001060The distinguishing index of a graph. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St000284The Plancherel distribution on integer partitions. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000681The Grundy value of Chomp on Ferrers diagrams. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000770The major index of an integer partition when read from bottom to top. St000815The number of semistandard Young tableaux of partition weight of given shape. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000933The number of multipartitions of sizes given by an integer partition. St000937The number of positive values of the symmetric group character corresponding to the partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001180Number of indecomposable injective modules with projective dimension at most 1. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001498The normalised height of a Nakayama algebra with magnitude 1. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St001877Number of indecomposable injective modules with projective dimension 2. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001234The number of indecomposable three dimensional modules with projective dimension one. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension in the Nakayama algebra corresponding to the Dyck path. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St000117The number of centered tunnels of a Dyck path. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St000015The number of peaks of a Dyck path. St000331The number of upper interactions of a Dyck path. St001021Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the Dyck path. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!