Processing math: 100%

Your data matches 131 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Mp00198: Posets incomparability graphGraphs
St000286: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> 1
([],2)
=> ([(0,1)],2)
=> 2
([(0,1)],2)
=> ([],2)
=> 1
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 2
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> 1
([(0,2),(2,1)],3)
=> ([],3)
=> 1
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 1
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(1,2),(1,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 1
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> 1
([(1,2),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 2
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> 1
([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(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)
=> 1
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 1
([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(1,2),(1,3),(1,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 1
([(1,3),(1,4),(4,2)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> 1
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> 1
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> 1
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> 1
([(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 1
([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,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.
Mp00074: Posets to graphGraphs
St000287: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> 2
([(0,1)],2)
=> ([(0,1)],2)
=> 1
([],3)
=> ([],3)
=> 3
([(1,2)],3)
=> ([(1,2)],3)
=> 2
([(0,1),(0,2)],3)
=> ([(0,2),(1,2)],3)
=> 1
([(0,2),(2,1)],3)
=> ([(0,2),(1,2)],3)
=> 1
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 1
([],4)
=> ([],4)
=> 4
([(2,3)],4)
=> ([(2,3)],4)
=> 3
([(1,2),(1,3)],4)
=> ([(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(0,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
([(0,2),(0,3),(3,1)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 1
([(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 2
([(0,3),(3,1),(3,2)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 2
([(0,3),(1,3),(3,2)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> 2
([(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,2),(0,3),(1,2),(1,3)],4)
=> 1
([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 1
([],5)
=> ([],5)
=> 5
([(3,4)],5)
=> ([(3,4)],5)
=> 4
([(2,3),(2,4)],5)
=> ([(2,4),(3,4)],5)
=> 3
([(1,2),(1,3),(1,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 1
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 1
([(1,3),(1,4),(4,2)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> 2
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 1
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 1
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 1
([(2,3),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 3
([(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 2
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 3
([(1,4),(2,4),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 2
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 2
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(2,3)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1
Description
The number of connected components of a graph.
Mp00074: Posets to graphGraphs
Mp00037: Graphs to partition of connected componentsInteger partitions
St000010: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> [1]
=> 1
([],2)
=> ([],2)
=> [1,1]
=> 2
([(0,1)],2)
=> ([(0,1)],2)
=> [2]
=> 1
([],3)
=> ([],3)
=> [1,1,1]
=> 3
([(1,2)],3)
=> ([(1,2)],3)
=> [2,1]
=> 2
([(0,1),(0,2)],3)
=> ([(0,2),(1,2)],3)
=> [3]
=> 1
([(0,2),(2,1)],3)
=> ([(0,2),(1,2)],3)
=> [3]
=> 1
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> [3]
=> 1
([],4)
=> ([],4)
=> [1,1,1,1]
=> 4
([(2,3)],4)
=> ([(2,3)],4)
=> [2,1,1]
=> 3
([(1,2),(1,3)],4)
=> ([(1,3),(2,3)],4)
=> [3,1]
=> 2
([(0,1),(0,2),(0,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [4]
=> 1
([(0,2),(0,3),(3,1)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [4]
=> 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> 1
([(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> [3,1]
=> 2
([(0,3),(3,1),(3,2)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [4]
=> 1
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> [3,1]
=> 2
([(0,3),(1,3),(3,2)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [4]
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [4]
=> 1
([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> [2,2]
=> 2
([(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,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> 1
([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [4]
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [4]
=> 1
([],5)
=> ([],5)
=> [1,1,1,1,1]
=> 5
([(3,4)],5)
=> ([(3,4)],5)
=> [2,1,1,1]
=> 4
([(2,3),(2,4)],5)
=> ([(2,4),(3,4)],5)
=> [3,1,1]
=> 3
([(1,2),(1,3),(1,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 2
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> 1
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> [5]
=> 1
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> 1
([(1,3),(1,4),(4,2)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> [4,1]
=> 2
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> [5]
=> 1
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> [4,1]
=> 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> 1
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> [5]
=> 1
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> 1
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> 1
([(2,3),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> [3,1,1]
=> 3
([(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 2
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> 1
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> [3,1,1]
=> 3
([(1,4),(2,4),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 2
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 2
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> 1
([(0,4),(1,4),(2,3)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> [3,2]
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> [5]
=> 1
Description
The length of the partition.
Mp00074: Posets to graphGraphs
Mp00152: Graphs Laplacian multiplicitiesInteger compositions
St000383: Integer compositions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> [1] => 1
([],2)
=> ([],2)
=> [2] => 2
([(0,1)],2)
=> ([(0,1)],2)
=> [1,1] => 1
([],3)
=> ([],3)
=> [3] => 3
([(1,2)],3)
=> ([(1,2)],3)
=> [1,2] => 2
([(0,1),(0,2)],3)
=> ([(0,2),(1,2)],3)
=> [1,1,1] => 1
([(0,2),(2,1)],3)
=> ([(0,2),(1,2)],3)
=> [1,1,1] => 1
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> [1,1,1] => 1
([],4)
=> ([],4)
=> [4] => 4
([(2,3)],4)
=> ([(2,3)],4)
=> [1,3] => 3
([(1,2),(1,3)],4)
=> ([(1,3),(2,3)],4)
=> [1,1,2] => 2
([(0,1),(0,2),(0,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [1,2,1] => 1
([(0,2),(0,3),(3,1)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [1,1,1,1] => 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> [1,2,1] => 1
([(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> [1,1,2] => 2
([(0,3),(3,1),(3,2)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [1,2,1] => 1
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> [1,1,2] => 2
([(0,3),(1,3),(3,2)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [1,2,1] => 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [1,2,1] => 1
([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> [2,2] => 2
([(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,2),(0,3),(1,2),(1,3)],4)
=> [1,2,1] => 1
([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [1,1,1,1] => 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [1,1,1,1] => 1
([],5)
=> ([],5)
=> [5] => 5
([(3,4)],5)
=> ([(3,4)],5)
=> [1,4] => 4
([(2,3),(2,4)],5)
=> ([(2,4),(3,4)],5)
=> [1,1,3] => 3
([(1,2),(1,3),(1,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [1,2,2] => 2
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,3,1] => 1
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1,1] => 1
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [1,1,2,1] => 1
([(1,3),(1,4),(4,2)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> [1,1,1,2] => 2
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1,1] => 1
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> [1,2,2] => 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => 1
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1,1] => 1
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => 1
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [1,1,2,1] => 1
([(2,3),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> [1,1,3] => 3
([(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [1,2,2] => 2
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,3,1] => 1
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> [1,1,3] => 3
([(1,4),(2,4),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [1,2,2] => 2
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,3,1] => 1
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [1,2,2] => 2
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,3,1] => 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,3,1] => 1
([(0,4),(1,4),(2,3)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> [1,1,1,2] => 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1,1] => 1
Description
The last part of an integer composition.
Mp00074: Posets to graphGraphs
Mp00147: Graphs squareGraphs
St000553: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> ([],2)
=> 2
([(0,1)],2)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([],3)
=> ([],3)
=> ([],3)
=> 3
([(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> 2
([(0,1),(0,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,2),(2,1)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([],4)
=> ([],4)
=> ([],4)
=> 4
([(2,3)],4)
=> ([(2,3)],4)
=> ([(2,3)],4)
=> 3
([(1,2),(1,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(0,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,2),(0,3),(3,1)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(3,1),(3,2)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(1,3),(3,2)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(1,3),(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),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> 2
([(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,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([],5)
=> ([],5)
=> ([],5)
=> 5
([(3,4)],5)
=> ([(3,4)],5)
=> ([(3,4)],5)
=> 4
([(2,3),(2,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3
([(1,2),(1,3),(1,4)],5)
=> ([(1,4),(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),(0,4)],5)
=> ([(0,4),(1,4),(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),(0,4),(4,1)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(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),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(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
([(1,3),(1,4),(4,2)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,2),(1,3),(2,4),(3,4)],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,4),(4,1)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(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
([(2,3),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3
([(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(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,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3
([(1,4),(2,4),(4,3)],5)
=> ([(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),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(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),(3,4)],5)
=> ([(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,4),(4,3)],5)
=> ([(0,4),(1,4),(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),(3,4)],5)
=> ([(0,4),(1,4),(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,3)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(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: St000147
Mp00074: Posets to graphGraphs
Mp00037: Graphs to partition of connected componentsInteger partitions
Mp00044: Integer partitions conjugateInteger partitions
St000147: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> [1]
=> [1]
=> 1
([],2)
=> ([],2)
=> [1,1]
=> [2]
=> 2
([(0,1)],2)
=> ([(0,1)],2)
=> [2]
=> [1,1]
=> 1
([],3)
=> ([],3)
=> [1,1,1]
=> [3]
=> 3
([(1,2)],3)
=> ([(1,2)],3)
=> [2,1]
=> [2,1]
=> 2
([(0,1),(0,2)],3)
=> ([(0,2),(1,2)],3)
=> [3]
=> [1,1,1]
=> 1
([(0,2),(2,1)],3)
=> ([(0,2),(1,2)],3)
=> [3]
=> [1,1,1]
=> 1
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> [3]
=> [1,1,1]
=> 1
([],4)
=> ([],4)
=> [1,1,1,1]
=> [4]
=> 4
([(2,3)],4)
=> ([(2,3)],4)
=> [2,1,1]
=> [3,1]
=> 3
([(1,2),(1,3)],4)
=> ([(1,3),(2,3)],4)
=> [3,1]
=> [2,1,1]
=> 2
([(0,1),(0,2),(0,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([(0,2),(0,3),(3,1)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> [3,1]
=> [2,1,1]
=> 2
([(0,3),(3,1),(3,2)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> [3,1]
=> [2,1,1]
=> 2
([(0,3),(1,3),(3,2)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> [2,2]
=> [2,2]
=> 2
([(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,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([],5)
=> ([],5)
=> [1,1,1,1,1]
=> [5]
=> 5
([(3,4)],5)
=> ([(3,4)],5)
=> [2,1,1,1]
=> [4,1]
=> 4
([(2,3),(2,4)],5)
=> ([(2,4),(3,4)],5)
=> [3,1,1]
=> [3,1,1]
=> 3
([(1,2),(1,3),(1,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> 2
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(1,3),(1,4),(4,2)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> 2
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> [4,1]
=> [2,1,1,1]
=> 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(2,3),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> [3,1,1]
=> [3,1,1]
=> 3
([(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> 2
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> [3,1,1]
=> [3,1,1]
=> 3
([(1,4),(2,4),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> 2
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> 2
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,4),(1,4),(2,3)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> [3,2]
=> [2,2,1]
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
Description
The largest part of an integer partition.
Mp00074: Posets to graphGraphs
Mp00152: Graphs Laplacian multiplicitiesInteger compositions
Mp00184: Integer compositions to threshold graphGraphs
St000273: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> [1] => ([],1)
=> 1
([],2)
=> ([],2)
=> [2] => ([],2)
=> 2
([(0,1)],2)
=> ([(0,1)],2)
=> [1,1] => ([(0,1)],2)
=> 1
([],3)
=> ([],3)
=> [3] => ([],3)
=> 3
([(1,2)],3)
=> ([(1,2)],3)
=> [1,2] => ([(1,2)],3)
=> 2
([(0,1),(0,2)],3)
=> ([(0,2),(1,2)],3)
=> [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,2),(2,1)],3)
=> ([(0,2),(1,2)],3)
=> [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 1
([],4)
=> ([],4)
=> [4] => ([],4)
=> 4
([(2,3)],4)
=> ([(2,3)],4)
=> [1,3] => ([(2,3)],4)
=> 3
([(1,2),(1,3)],4)
=> ([(1,3),(2,3)],4)
=> [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(0,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,2),(0,3),(3,1)],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,1),(0,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(3,1),(3,2)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(1,3),(3,2)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(1,3),(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),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> [2,2] => ([(1,3),(2,3)],4)
=> 2
([(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,2),(0,3),(1,2),(1,3)],4)
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(2,1),(3,2)],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,3),(1,2),(2,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
([],5)
=> ([],5)
=> [5] => ([],5)
=> 5
([(3,4)],5)
=> ([(3,4)],5)
=> [1,4] => ([(3,4)],5)
=> 4
([(2,3),(2,4)],5)
=> ([(2,4),(3,4)],5)
=> [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 3
([(1,2),(1,3),(1,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(0,4),(1,4),(2,3),(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,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,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,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,3),(1,4),(4,2)],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,3),(0,4),(4,1),(4,2)],5)
=> ([(0,4),(1,4),(2,3),(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
([(1,2),(1,3),(2,4),(3,4)],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,4),(4,1)],5)
=> ([(0,4),(1,2),(1,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),(3,2),(4,1)],5)
=> ([(0,4),(1,3),(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,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(0,4),(1,2),(1,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,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(2,3),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 3
([(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 3
([(1,4),(2,4),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(2,3)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(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
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.
Matching statistic: St000288
Mp00074: Posets to graphGraphs
Mp00037: Graphs to partition of connected componentsInteger partitions
Mp00095: Integer partitions to binary wordBinary words
St000288: Binary words ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> [1]
=> 10 => 1
([],2)
=> ([],2)
=> [1,1]
=> 110 => 2
([(0,1)],2)
=> ([(0,1)],2)
=> [2]
=> 100 => 1
([],3)
=> ([],3)
=> [1,1,1]
=> 1110 => 3
([(1,2)],3)
=> ([(1,2)],3)
=> [2,1]
=> 1010 => 2
([(0,1),(0,2)],3)
=> ([(0,2),(1,2)],3)
=> [3]
=> 1000 => 1
([(0,2),(2,1)],3)
=> ([(0,2),(1,2)],3)
=> [3]
=> 1000 => 1
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> [3]
=> 1000 => 1
([],4)
=> ([],4)
=> [1,1,1,1]
=> 11110 => 4
([(2,3)],4)
=> ([(2,3)],4)
=> [2,1,1]
=> 10110 => 3
([(1,2),(1,3)],4)
=> ([(1,3),(2,3)],4)
=> [3,1]
=> 10010 => 2
([(0,1),(0,2),(0,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [4]
=> 10000 => 1
([(0,2),(0,3),(3,1)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [4]
=> 10000 => 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> 10000 => 1
([(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> [3,1]
=> 10010 => 2
([(0,3),(3,1),(3,2)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [4]
=> 10000 => 1
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> [3,1]
=> 10010 => 2
([(0,3),(1,3),(3,2)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [4]
=> 10000 => 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [4]
=> 10000 => 1
([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> [2,2]
=> 1100 => 2
([(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [4]
=> 10000 => 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> 10000 => 1
([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [4]
=> 10000 => 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [4]
=> 10000 => 1
([],5)
=> ([],5)
=> [1,1,1,1,1]
=> 111110 => 5
([(3,4)],5)
=> ([(3,4)],5)
=> [2,1,1,1]
=> 101110 => 4
([(2,3),(2,4)],5)
=> ([(2,4),(3,4)],5)
=> [3,1,1]
=> 100110 => 3
([(1,2),(1,3),(1,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 100010 => 2
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> 100000 => 1
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> [5]
=> 100000 => 1
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> 100000 => 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> 100000 => 1
([(1,3),(1,4),(4,2)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> [4,1]
=> 100010 => 2
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> [5]
=> 100000 => 1
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> [4,1]
=> 100010 => 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> 100000 => 1
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> [5]
=> 100000 => 1
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> 100000 => 1
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> 100000 => 1
([(2,3),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> [3,1,1]
=> 100110 => 3
([(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 100010 => 2
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> 100000 => 1
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> [3,1,1]
=> 100110 => 3
([(1,4),(2,4),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 100010 => 2
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> 100000 => 1
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 100010 => 2
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> 100000 => 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> 100000 => 1
([(0,4),(1,4),(2,3)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> [3,2]
=> 10100 => 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> [5]
=> 100000 => 1
Description
The number of ones in a binary word. This is also known as the Hamming weight of the word.
Matching statistic: St000378
Mp00074: Posets to graphGraphs
Mp00037: Graphs to partition of connected componentsInteger partitions
Mp00322: Integer partitions Loehr-WarringtonInteger partitions
St000378: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> [1]
=> [1]
=> 1
([],2)
=> ([],2)
=> [1,1]
=> [2]
=> 2
([(0,1)],2)
=> ([(0,1)],2)
=> [2]
=> [1,1]
=> 1
([],3)
=> ([],3)
=> [1,1,1]
=> [2,1]
=> 3
([(1,2)],3)
=> ([(1,2)],3)
=> [2,1]
=> [3]
=> 2
([(0,1),(0,2)],3)
=> ([(0,2),(1,2)],3)
=> [3]
=> [1,1,1]
=> 1
([(0,2),(2,1)],3)
=> ([(0,2),(1,2)],3)
=> [3]
=> [1,1,1]
=> 1
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> [3]
=> [1,1,1]
=> 1
([],4)
=> ([],4)
=> [1,1,1,1]
=> [3,1]
=> 4
([(2,3)],4)
=> ([(2,3)],4)
=> [2,1,1]
=> [2,2]
=> 3
([(1,2),(1,3)],4)
=> ([(1,3),(2,3)],4)
=> [3,1]
=> [2,1,1]
=> 2
([(0,1),(0,2),(0,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([(0,2),(0,3),(3,1)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> [3,1]
=> [2,1,1]
=> 2
([(0,3),(3,1),(3,2)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> [3,1]
=> [2,1,1]
=> 2
([(0,3),(1,3),(3,2)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> [2,2]
=> [4]
=> 2
([(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,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([],5)
=> ([],5)
=> [1,1,1,1,1]
=> [3,2]
=> 5
([(3,4)],5)
=> ([(3,4)],5)
=> [2,1,1,1]
=> [3,1,1]
=> 4
([(2,3),(2,4)],5)
=> ([(2,4),(3,4)],5)
=> [3,1,1]
=> [4,1]
=> 3
([(1,2),(1,3),(1,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> 2
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(1,3),(1,4),(4,2)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> 2
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> [4,1]
=> [2,1,1,1]
=> 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(2,3),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> [3,1,1]
=> [4,1]
=> 3
([(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> 2
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> [3,1,1]
=> [4,1]
=> 3
([(1,4),(2,4),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> 2
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> 2
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
([(0,4),(1,4),(2,3)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> [3,2]
=> [5]
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 1
Description
The diagonal inversion number of an integer partition. The dinv of a partition is the number of cells c in the diagram of an integer partition λ for which arm(c)leg(c){0,1}. See also exercise 3.19 of [2]. This statistic is equidistributed with the length of the partition, see [3].
Mp00198: Posets incomparability graphGraphs
Mp00203: Graphs coneGraphs
Mp00152: Graphs Laplacian multiplicitiesInteger compositions
St000382: Integer compositions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> ([(0,1)],2)
=> [1,1] => 1
([],2)
=> ([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> [2,1] => 2
([(0,1)],2)
=> ([],2)
=> ([(0,2),(1,2)],3)
=> [1,1,1] => 1
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1] => 3
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => 2
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => 1
([(0,2),(2,1)],3)
=> ([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> [1,2,1] => 1
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => 1
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1] => 4
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 3
([(1,2),(1,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => 2
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,2,1,1] => 1
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,2,1] => 1
([(1,2),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => 2
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,2,1] => 1
([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => 2
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,2,1] => 1
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,2,1,1] => 1
([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => 2
([(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [1,2,1,1] => 1
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,3,1] => 1
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => 1
([],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),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [5,1] => 5
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,1,1] => 4
([(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1] => 3
([(1,2),(1,3),(1,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [2,2,1,1] => 2
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [1,3,1,1] => 1
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [1,2,1,1,1] => 1
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [1,1,1,1,1,1] => 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [1,2,2,1] => 1
([(1,3),(1,4),(4,2)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [2,1,1,1,1] => 2
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [1,1,1,1,1,1] => 1
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [2,1,2,1] => 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [1,1,3,1] => 1
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> [1,1,2,1,1] => 1
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> [1,1,1,1,1,1] => 1
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> [1,2,2,1] => 1
([(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,2,1] => 3
([(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [2,1,2,1] => 2
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [1,2,2,1] => 1
([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1] => 3
([(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [2,1,2,1] => 2
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> [1,2,2,1] => 1
([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [2,2,1,1] => 2
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [1,2,2,1] => 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [1,3,1,1] => 1
([(0,4),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> [2,1,1,1,1] => 2
([(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,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [1,1,1,1,1,1] => 1
Description
The first part of an integer composition.
The following 121 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000544The cop number of a graph. 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. St001363The Euler characteristic of a graph according to Knill. 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. St001828The Euler characteristic of a graph. St000773The multiplicity of the largest Laplacian eigenvalue in 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. St000456The monochromatic index of a connected graph. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. 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. St001199The dominant dimension of eAe for the corresponding Nakayama algebra A with minimal faithful projective-injective module eA. St001389The number of partitions of the same length below the given integer partition. St001527The cyclic permutation representation number of an integer partition. St001571The Cartan determinant of the integer partition. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. 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. St000908The length of the shortest maximal antichain in a poset. St000909The number of maximal chains of maximal size in a poset. St001268The size of the largest ordinal summand in the poset. St001399The distinguishing number of a poset. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001533The largest coefficient of the Poincare polynomial of the poset cone. St001779The order of promotion on the set of linear extensions of a poset. St000706The product of the factorials of the multiplicities of an integer partition. St000993The multiplicity of the largest part of an integer partition. St001568The smallest positive integer that does not appear twice in the partition. 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 dimExt1(I,A)=1 for the incidence algebra A of a poset. 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. St000914The sum of the values of the Möbius function of a poset. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St001890The maximum magnitude of the Möbius function of a poset. St000781The number of proper colouring schemes of a Ferrers diagram. St001432The order dimension of the 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. St001924The number of cells in an integer partition whose arm and leg length coincide. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000100The number of linear extensions of a poset. 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. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001645The pebbling number of a connected graph. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000302The determinant of the distance matrix of a connected graph. St000466The Gutman (or modified Schultz) index of a connected graph. St000467The hyper-Wiener index of a connected graph. 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. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001877Number of indecomposable injective modules with projective dimension 2. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St000668The least common multiple of the parts of the partition. St001128The exponens consonantiae of a partition. St001498The normalised height of a Nakayama algebra with magnitude 1. St001107The number of times one can erase the first up and the last down step in a Dyck path and still remain a Dyck path. St001570The minimal number of edges to add to make a graph Hamiltonian. 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. St001118The acyclic chromatic index of a graph. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001933The largest multiplicity of a part in an integer 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. 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. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. 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. St001481The minimal height of a peak of a Dyck path. St000968We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) [c0,c1,...,cn1] by adding c0 to cn1. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St000120The number of left tunnels of a Dyck path. St000954Number of times the corresponding LNakayama algebra has Exti(D(A),A)=0 for i>0. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series L=[c0,c1,...,cn1] such that n=c0<ci for all i>0 a special CNakayama algebra. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001195The global dimension of the algebra A/AfA of the corresponding Nakayama algebra A with minimal left faithful projective-injective module Af. St001613The binary logarithm of the size of the center of a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices. 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. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000344The number of strongly connected outdegree sequences of a graph. St000379The number of Hamiltonian cycles in a graph. St001368The number of vertices of maximal degree in a graph.