searching the database
Your data matches 415 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: St000722
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St000722: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St000722: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => ([],1)
=> ([],1)
=> 1
[1,0,1,0]
=> [2,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> 2
[1,1,0,0]
=> [1,2] => ([],2)
=> ([],1)
=> 1
[1,0,1,0,1,0]
=> [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
[1,1,0,0,1,0]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
[1,1,1,0,0,0]
=> [1,2,3] => ([],3)
=> ([],1)
=> 1
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => ([(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)
=> 4
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 2
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([],4)
=> ([],1)
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => ([(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)
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,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),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,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),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,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),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => ([(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),(1,2),(1,3),(2,3)],4)
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,1,0,0,0,1,1,0,0]
=> [4,5,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,1,1,0,0,0,0,1,0]
=> [5,1,2,3,4] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,2,1] => ([(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)
=> ([(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)
=> 6
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [5,6,4,3,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [6,4,5,3,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [5,4,6,3,2,1] => ([(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)
=> ([(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)
=> 6
[1,0,1,0,1,0,1,1,1,0,0,0]
=> [4,5,6,3,2,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [6,5,3,4,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [5,6,3,4,2,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [6,4,3,5,2,1] => ([(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)
=> ([(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)
=> 6
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [6,3,4,5,2,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,1,1,0,0,0,0]
=> [3,4,5,6,2,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,3,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [5,6,4,2,3,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [6,4,5,2,3,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [4,5,6,2,3,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,4,1] => ([(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)
=> ([(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)
=> 6
[1,0,1,1,1,0,0,0,1,0,1,0]
=> [6,5,2,3,4,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [5,6,2,3,4,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [6,2,3,4,5,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
Description
The number of different neighbourhoods in a graph.
Matching statistic: St001645
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St001645: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St001645: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => ([],1)
=> ([],1)
=> 1
[1,0,1,0]
=> [2,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> 2
[1,1,0,0]
=> [1,2] => ([],2)
=> ([],1)
=> 1
[1,0,1,0,1,0]
=> [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
[1,1,0,0,1,0]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
[1,1,1,0,0,0]
=> [1,2,3] => ([],3)
=> ([],1)
=> 1
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => ([(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)
=> 4
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 2
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([],4)
=> ([],1)
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => ([(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)
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,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),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,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),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,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),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => ([(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),(1,2),(1,3),(2,3)],4)
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,1,0,0,0,1,1,0,0]
=> [4,5,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,1,1,0,0,0,0,1,0]
=> [5,1,2,3,4] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,2,1] => ([(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)
=> ([(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)
=> 6
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [5,6,4,3,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [6,4,5,3,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [5,4,6,3,2,1] => ([(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)
=> ([(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)
=> 6
[1,0,1,0,1,0,1,1,1,0,0,0]
=> [4,5,6,3,2,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [6,5,3,4,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [5,6,3,4,2,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [6,4,3,5,2,1] => ([(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)
=> ([(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)
=> 6
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [6,3,4,5,2,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,1,1,0,0,0,0]
=> [3,4,5,6,2,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,3,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [5,6,4,2,3,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [6,4,5,2,3,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [4,5,6,2,3,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,4,1] => ([(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)
=> ([(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)
=> 6
[1,0,1,1,1,0,0,0,1,0,1,0]
=> [6,5,2,3,4,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [5,6,2,3,4,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [6,2,3,4,5,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
Description
The pebbling number of a connected graph.
Matching statistic: St001707
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St001707: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St001707: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => ([],1)
=> ([],1)
=> 1
[1,0,1,0]
=> [2,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> 2
[1,1,0,0]
=> [1,2] => ([],2)
=> ([],1)
=> 1
[1,0,1,0,1,0]
=> [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
[1,1,0,0,1,0]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
[1,1,1,0,0,0]
=> [1,2,3] => ([],3)
=> ([],1)
=> 1
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => ([(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)
=> 4
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 2
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([],4)
=> ([],1)
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => ([(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)
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,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),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,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),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,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),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => ([(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),(1,2),(1,3),(2,3)],4)
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,1,0,0,0,1,1,0,0]
=> [4,5,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,1,1,0,0,0,0,1,0]
=> [5,1,2,3,4] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,2,1] => ([(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)
=> ([(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)
=> 6
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [5,6,4,3,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [6,4,5,3,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [5,4,6,3,2,1] => ([(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)
=> ([(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)
=> 6
[1,0,1,0,1,0,1,1,1,0,0,0]
=> [4,5,6,3,2,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [6,5,3,4,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [5,6,3,4,2,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [6,4,3,5,2,1] => ([(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)
=> ([(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)
=> 6
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [6,3,4,5,2,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,1,1,0,0,0,0]
=> [3,4,5,6,2,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,3,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [5,6,4,2,3,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [6,4,5,2,3,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [4,5,6,2,3,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,4,1] => ([(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)
=> ([(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)
=> 6
[1,0,1,1,1,0,0,0,1,0,1,0]
=> [6,5,2,3,4,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [5,6,2,3,4,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [6,2,3,4,5,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
Description
The length of a longest path in a graph such that the remaining vertices can be partitioned into two sets of the same size without edges between them.
Such a partition always exists because of a construction due to Dudek and Pralat [1] and independently Pokrovskiy [2].
Matching statistic: St001746
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St001746: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St001746: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => ([],1)
=> ([],1)
=> 1
[1,0,1,0]
=> [2,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> 2
[1,1,0,0]
=> [1,2] => ([],2)
=> ([],1)
=> 1
[1,0,1,0,1,0]
=> [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
[1,1,0,0,1,0]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
[1,1,1,0,0,0]
=> [1,2,3] => ([],3)
=> ([],1)
=> 1
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => ([(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)
=> 4
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 2
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([],4)
=> ([],1)
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => ([(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)
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,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),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,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),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,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),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => ([(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),(1,2),(1,3),(2,3)],4)
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,1,0,0,0,1,1,0,0]
=> [4,5,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,1,1,0,0,0,0,1,0]
=> [5,1,2,3,4] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,2,1] => ([(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)
=> ([(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)
=> 6
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [5,6,4,3,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [6,4,5,3,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [5,4,6,3,2,1] => ([(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)
=> ([(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)
=> 6
[1,0,1,0,1,0,1,1,1,0,0,0]
=> [4,5,6,3,2,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [6,5,3,4,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [5,6,3,4,2,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [6,4,3,5,2,1] => ([(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)
=> ([(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)
=> 6
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [6,3,4,5,2,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,1,1,0,0,0,0]
=> [3,4,5,6,2,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,3,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [5,6,4,2,3,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [6,4,5,2,3,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [4,5,6,2,3,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,4,1] => ([(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)
=> ([(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)
=> 6
[1,0,1,1,1,0,0,0,1,0,1,0]
=> [6,5,2,3,4,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [5,6,2,3,4,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [6,2,3,4,5,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
Description
The coalition number of a graph.
This is the maximal cardinality of a set partition such that each block is either a dominating set of cardinality one, or is not a dominating set but can be joined with a second block to form a dominating set.
Matching statistic: St000987
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St000987: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St000987: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => ([],1)
=> ([],1)
=> 0 = 1 - 1
[1,0,1,0]
=> [2,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,1,0,0]
=> [1,2] => ([],2)
=> ([],1)
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,0,1,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> [1,2,3] => ([],3)
=> ([],1)
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => ([(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)
=> 3 = 4 - 1
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([],4)
=> ([],1)
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => ([(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)
=> 4 = 5 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,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),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,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),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,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),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => ([(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),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [4,5,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0,1,0]
=> [5,1,2,3,4] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,2,1] => ([(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)
=> ([(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 = 6 - 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [5,6,4,3,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 5 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [6,4,5,3,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 5 - 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [5,4,6,3,2,1] => ([(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)
=> ([(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 = 6 - 1
[1,0,1,0,1,0,1,1,1,0,0,0]
=> [4,5,6,3,2,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [6,5,3,4,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 5 - 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [5,6,3,4,2,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [6,4,3,5,2,1] => ([(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)
=> ([(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 = 6 - 1
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [6,3,4,5,2,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,0,1,0,1,1,1,1,0,0,0,0]
=> [3,4,5,6,2,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,3,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 5 - 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [5,6,4,2,3,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [6,4,5,2,3,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [4,5,6,2,3,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,4,1] => ([(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)
=> ([(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 = 6 - 1
[1,0,1,1,1,0,0,0,1,0,1,0]
=> [6,5,2,3,4,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [5,6,2,3,4,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [6,2,3,4,5,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 1 = 2 - 1
Description
The number of positive eigenvalues of the Laplacian matrix of the graph.
This is the number of vertices minus the number of connected components of the graph.
Matching statistic: St001120
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St001120: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St001120: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => ([],1)
=> ([],1)
=> 0 = 1 - 1
[1,0,1,0]
=> [2,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,1,0,0]
=> [1,2] => ([],2)
=> ([],1)
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,0,1,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> [1,2,3] => ([],3)
=> ([],1)
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => ([(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)
=> 3 = 4 - 1
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([],4)
=> ([],1)
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => ([(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)
=> 4 = 5 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,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),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,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),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,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),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => ([(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),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [4,5,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0,1,0]
=> [5,1,2,3,4] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,2,1] => ([(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)
=> ([(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 = 6 - 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [5,6,4,3,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 5 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [6,4,5,3,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 5 - 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [5,4,6,3,2,1] => ([(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)
=> ([(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 = 6 - 1
[1,0,1,0,1,0,1,1,1,0,0,0]
=> [4,5,6,3,2,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [6,5,3,4,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 5 - 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [5,6,3,4,2,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [6,4,3,5,2,1] => ([(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)
=> ([(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 = 6 - 1
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [6,3,4,5,2,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,0,1,0,1,1,1,1,0,0,0,0]
=> [3,4,5,6,2,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,3,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 5 - 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [5,6,4,2,3,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [6,4,5,2,3,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [4,5,6,2,3,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,4,1] => ([(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)
=> ([(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 = 6 - 1
[1,0,1,1,1,0,0,0,1,0,1,0]
=> [6,5,2,3,4,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [5,6,2,3,4,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [6,2,3,4,5,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 1 = 2 - 1
Description
The length of a longest path in a graph.
Matching statistic: St001725
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St001725: Graphs ⟶ ℤResult quality: 86% ●values known / values provided: 93%●distinct values known / distinct values provided: 86%
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St001725: Graphs ⟶ ℤResult quality: 86% ●values known / values provided: 93%●distinct values known / distinct values provided: 86%
Values
[1,0]
=> [1] => ([],1)
=> ([],1)
=> 1
[1,0,1,0]
=> [2,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> 2
[1,1,0,0]
=> [1,2] => ([],2)
=> ([],1)
=> 1
[1,0,1,0,1,0]
=> [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
[1,1,0,0,1,0]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
[1,1,1,0,0,0]
=> [1,2,3] => ([],3)
=> ([],1)
=> 1
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => ([(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)
=> 4
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 2
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([],4)
=> ([],1)
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => ([(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)
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,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),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,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),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,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),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => ([(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),(1,2),(1,3),(2,3)],4)
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,1,0,0,0,1,1,0,0]
=> [4,5,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,1,1,0,0,0,0,1,0]
=> [5,1,2,3,4] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,2,1] => ([(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)
=> ([(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)
=> 6
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [5,6,4,3,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [6,4,5,3,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [5,4,6,3,2,1] => ([(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)
=> ([(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)
=> 6
[1,0,1,0,1,0,1,1,1,0,0,0]
=> [4,5,6,3,2,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [6,5,3,4,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [5,6,3,4,2,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [6,4,3,5,2,1] => ([(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)
=> ([(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)
=> 6
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [6,3,4,5,2,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,1,1,0,0,0,0]
=> [3,4,5,6,2,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,3,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [5,6,4,2,3,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [6,4,5,2,3,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [4,5,6,2,3,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,4,1] => ([(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)
=> ([(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)
=> 6
[1,0,1,1,1,0,0,0,1,0,1,0]
=> [6,5,2,3,4,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [5,6,2,3,4,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [6,2,3,4,5,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
[1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [6,5,7,4,3,2,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,0,1,0,1,0,1,1,0,1,0,0,1,0]
=> [7,5,4,6,3,2,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [6,5,4,7,3,2,1] => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,0,1,0,1,1,0,1,0,0,1,0,1,0]
=> [7,6,4,3,5,2,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,0,1,0,1,1,0,1,0,1,0,0,1,0]
=> [7,5,4,3,6,2,1] => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,0,1,1,0,1,0,0,1,0,1,0,1,0]
=> [7,6,5,3,2,4,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,0,1,1,0,1,0,0,1,1,0,1,0,0]
=> [6,5,7,3,2,4,1] => ([(0,1),(0,4),(0,5),(0,6),(1,2),(1,3),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,4),(0,5),(0,6),(1,2),(1,3),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,0,1,1,0,1,0,1,0,0,1,0,1,0]
=> [7,6,4,3,2,5,1] => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,2,1,3] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,1,0,1,0,0,1,0,1,1,0,1,0,0]
=> [6,5,7,4,2,1,3] => ([(0,1),(0,4),(0,5),(0,6),(1,2),(1,3),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,4),(0,5),(0,6),(1,2),(1,3),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,1,0,1,0,0,1,1,0,1,0,0,1,0]
=> [7,5,4,6,2,1,3] => ([(0,1),(0,4),(0,5),(0,6),(1,2),(1,3),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,4),(0,5),(0,6),(1,2),(1,3),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,1,0,1,0,0,1,1,0,1,0,1,0,0]
=> [6,5,4,7,2,1,3] => ([(0,1),(0,5),(0,6),(1,2),(1,3),(1,4),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,5),(0,6),(1,2),(1,3),(1,4),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,1,0,1,0,1,0,0,1,0,1,0,1,0]
=> [7,6,5,3,2,1,4] => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,1,0,1,0,1,0,0,1,1,0,1,0,0]
=> [6,5,7,3,2,1,4] => ([(0,1),(0,5),(0,6),(1,2),(1,3),(1,4),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,5),(0,6),(1,2),(1,3),(1,4),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
Description
The harmonious chromatic number of a graph.
A harmonious colouring is a proper vertex colouring such that any pair of colours appears at most once on adjacent vertices.
Matching statistic: St001504
(load all 40 compositions to match this statistic)
(load all 40 compositions to match this statistic)
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St001504: Dyck paths ⟶ ℤResult quality: 77% ●values known / values provided: 77%●distinct values known / distinct values provided: 100%
St001504: Dyck paths ⟶ ℤResult quality: 77% ●values known / values provided: 77%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> 2 = 1 + 1
[1,0,1,0]
=> [1,1,0,0]
=> 3 = 2 + 1
[1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 5 = 4 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 7 = 6 + 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> 7 = 6 + 1
[1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> 7 = 6 + 1
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 6 = 5 + 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 7 = 6 + 1
[1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[1,0,1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,1,1,1,0,1,0,0,1,0,0,0,0,0]
=> ? = 6 + 1
[1,0,1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,1,0,1,0,0,0,0,0]
=> ? = 5 + 1
[1,0,1,0,1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,0,1,0,0,0,1,0,0,0,0]
=> ? = 6 + 1
[1,0,1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,1,1,1,0,0,1,0,0,1,0,0,0,0]
=> ? = 6 + 1
[1,0,1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,1,0,1,0,1,0,0,0,0]
=> ? = 5 + 1
[1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,1,0,0,0]
=> ? = 6 + 1
[1,0,1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,1,0,0,1,0,0,0,1,0,0,0]
=> ? = 6 + 1
[1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,1,0,0,1,0,0,0]
=> ? = 6 + 1
[1,0,1,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,1,0,1,0,0,1,0,0,0]
=> ? = 4 + 1
[1,0,1,0,1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,1,0,1,0,0,0]
=> ? = 4 + 1
[1,0,1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,1,0,1,0,1,0,0,0]
=> ? = 5 + 1
[1,0,1,0,1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,1,0,1,0,0,0]
=> ? = 4 + 1
[1,0,1,1,0,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,1,0,0]
=> ? = 6 + 1
[1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,1,0,0,1,0,0,0,0,1,0,0]
=> ? = 6 + 1
[1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,1,0,0,0,1,0,0]
=> ? = 6 + 1
[1,0,1,1,0,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,1,0,1,0,0,0,1,0,0]
=> ? = 4 + 1
[1,0,1,1,0,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,1,0,0,1,0,0]
=> ? = 6 + 1
[1,0,1,1,0,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,1,0,1,0,0,1,0,0]
=> ? = 4 + 1
[1,0,1,1,1,0,0,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,1,0,1,0,0]
=> ? = 4 + 1
[1,0,1,1,1,0,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,1,0,0,1,0,1,0,0]
=> ? = 4 + 1
[1,0,1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,1,0,1,0,0]
=> ? = 3 + 1
[1,0,1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,1,0,1,0,0]
=> ? = 5 + 1
[1,0,1,1,1,1,0,0,0,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,1,0,1,0,1,0,0]
=> ? = 4 + 1
[1,0,1,1,1,1,0,0,0,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,1,0,1,0,0]
=> ? = 4 + 1
[1,0,1,1,1,1,0,0,0,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,1,0,1,0,1,0,0]
=> ? = 3 + 1
[1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0,1,0]
=> ? = 6 + 1
[1,1,0,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,1,0,0,1,0,0,0,0,0,1,0]
=> ? = 6 + 1
[1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,1,0,0,0,0,1,0]
=> ? = 6 + 1
[1,1,0,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,1,0,1,0,0,0,0,1,0]
=> ? = 4 + 1
[1,1,0,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,1,0,0,0,1,0]
=> ? = 6 + 1
[1,1,0,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0,1,0]
=> ? = 6 + 1
[1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,1,0,0,1,0]
=> ? = 4 + 1
[1,1,0,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,1,0,0,1,0]
=> ? = 3 + 1
[1,1,0,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,1,0,0,1,0]
=> ? = 4 + 1
[1,1,0,0,1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,0,1,0,0,1,0]
=> ? = 3 + 1
[1,1,0,1,1,0,0,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0,1,1,0,1,0,0]
=> ? = 6 + 1
[1,1,0,1,1,0,0,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,1,0,1,0,0]
=> ? = 6 + 1
[1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0,1,0,1,0]
=> ? = 4 + 1
[1,1,1,0,0,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0,1,0,1,0]
=> ? = 4 + 1
[1,1,1,0,0,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0,1,0,1,0]
=> ? = 3 + 1
[1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0,1,0,1,0]
=> ? = 4 + 1
[1,1,1,0,0,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0,1,0,1,0]
=> ? = 3 + 1
[1,1,1,0,0,1,0,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0,1,1,0,0,1,0]
=> ? = 6 + 1
[1,1,1,0,1,0,0,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0,1,0,1,1,0,0]
=> ? = 6 + 1
[1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0]
=> ? = 5 + 1
[1,1,1,1,0,0,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 4 + 1
[1,1,1,1,0,0,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0,1,0,1,0]
=> ? = 4 + 1
[1,1,1,1,0,0,0,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0,1,0,1,0,1,0]
=> ? = 3 + 1
[1,1,1,1,0,0,0,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0,1,0,1,0]
=> ? = 4 + 1
[1,1,1,1,0,0,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0,1,0,1,0]
=> ? = 3 + 1
Description
The sum of all indegrees of vertices with indegree at least two in the resolution quiver of a Nakayama algebra corresponding to the Dyck path.
Matching statistic: St000211
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00151: Permutations —to cycle type⟶ Set partitions
St000211: Set partitions ⟶ ℤResult quality: 77% ●values known / values provided: 77%●distinct values known / distinct values provided: 100%
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00151: Permutations —to cycle type⟶ Set partitions
St000211: Set partitions ⟶ ℤResult quality: 77% ●values known / values provided: 77%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => {{1}}
=> 0 = 1 - 1
[1,0,1,0]
=> [1,1,0,0]
=> [2,1] => {{1,2}}
=> 1 = 2 - 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,2] => {{1},{2}}
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => {{1,2,3}}
=> 2 = 3 - 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1,3] => {{1,2},{3}}
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,3,2] => {{1},{2,3}}
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => {{1},{2},{3}}
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => {{1,2,3,4}}
=> 3 = 4 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => {{1,2,3},{4}}
=> 2 = 3 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => {{1,2},{3,4}}
=> 2 = 3 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => {{1,2},{3},{4}}
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => {{1},{2,3,4}}
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => {{1},{2,3},{4}}
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => {{1},{2},{3,4}}
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => {{1},{2},{3},{4}}
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => {{1,2,3,4,5}}
=> 4 = 5 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => {{1,2,3,4},{5}}
=> 3 = 4 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => {{1,2,3},{4,5}}
=> 3 = 4 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => {{1,2,3},{4},{5}}
=> 2 = 3 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => {{1,2},{3,4,5}}
=> 3 = 4 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => {{1,2},{3,4},{5}}
=> 2 = 3 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => {{1,2},{3},{4,5}}
=> 2 = 3 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => {{1,2},{3},{4},{5}}
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => {{1},{2,3,4,5}}
=> 3 = 4 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => {{1},{2,3,4},{5}}
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => {{1},{2,3},{4,5}}
=> 2 = 3 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => {{1},{2,3},{4},{5}}
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => {{1},{2},{3,4,5}}
=> 2 = 3 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => {{1},{2},{3,4},{5}}
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => {{1},{2},{3},{4,5}}
=> 1 = 2 - 1
[1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => {{1},{2},{3},{4},{5}}
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,6,1] => {{1,2,3,4,5,6}}
=> 5 = 6 - 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> [2,3,4,5,1,6] => {{1,2,3,4,5},{6}}
=> 4 = 5 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> [2,3,4,1,6,5] => {{1,2,3,4},{5,6}}
=> 4 = 5 - 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [2,3,4,6,1,5] => {{1,2,3,4,5,6}}
=> 5 = 6 - 1
[1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> [2,3,4,1,5,6] => {{1,2,3,4},{5},{6}}
=> 3 = 4 - 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0]
=> [2,3,1,5,6,4] => {{1,2,3},{4,5,6}}
=> 4 = 5 - 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> [2,3,1,5,4,6] => {{1,2,3},{4,5},{6}}
=> 3 = 4 - 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [2,3,5,1,6,4] => {{1,2,3,4,5,6}}
=> 5 = 6 - 1
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0]
=> [2,3,1,4,6,5] => {{1,2,3},{4},{5,6}}
=> 3 = 4 - 1
[1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6] => {{1,2,3},{4},{5},{6}}
=> 2 = 3 - 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,0]
=> [2,1,4,5,6,3] => {{1,2},{3,4,5,6}}
=> 4 = 5 - 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0]
=> [2,1,4,5,3,6] => {{1,2},{3,4,5},{6}}
=> 3 = 4 - 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,6,5] => {{1,2},{3,4},{5,6}}
=> 3 = 4 - 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0]
=> [2,1,4,3,5,6] => {{1,2},{3,4},{5},{6}}
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [2,4,1,5,6,3] => {{1,2,3,4,5,6}}
=> 5 = 6 - 1
[1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,1,0,1,0,0]
=> [2,1,3,5,6,4] => {{1,2},{3},{4,5,6}}
=> 3 = 4 - 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> [2,1,3,5,4,6] => {{1,2},{3},{4,5},{6}}
=> 2 = 3 - 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> [2,1,3,4,6,5] => {{1,2},{3},{4},{5,6}}
=> 2 = 3 - 1
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,3,4,5,6] => {{1,2},{3},{4},{5},{6}}
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,1,0,0,1,0]
=> [2,3,4,5,1,7,6,8] => {{1,2,3,4,5},{6,7},{8}}
=> ? = 6 - 1
[1,0,1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0,1,0,1,0]
=> [2,3,4,5,1,6,7,8] => {{1,2,3,4,5},{6},{7},{8}}
=> ? = 5 - 1
[1,0,1,0,1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,1,0,0,1,0]
=> [2,3,4,1,6,7,5,8] => {{1,2,3,4},{5,6,7},{8}}
=> ? = 6 - 1
[1,0,1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0,1,1,0,0]
=> [2,3,4,1,6,5,8,7] => {{1,2,3,4},{5,6},{7,8}}
=> ? = 6 - 1
[1,0,1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5,6,8,7] => {{1,2,3,4},{5},{6},{7,8}}
=> ? = 5 - 1
[1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,1,0,0,1,0]
=> [2,3,1,5,6,7,4,8] => {{1,2,3},{4,5,6,7},{8}}
=> ? = 6 - 1
[1,0,1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,6,4,8,7] => ?
=> ? = 6 - 1
[1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0,1,1,0,1,0,0]
=> [2,3,1,5,4,7,8,6] => ?
=> ? = 6 - 1
[1,0,1,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0,1,0,1,0]
=> [2,3,1,5,4,6,7,8] => {{1,2,3},{4,5},{6},{7},{8}}
=> ? = 4 - 1
[1,0,1,0,1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> [2,3,1,4,6,5,7,8] => ?
=> ? = 4 - 1
[1,0,1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0,1,1,0,1,0,0]
=> [2,3,1,4,5,7,8,6] => {{1,2,3},{4},{5},{6,7,8}}
=> ? = 5 - 1
[1,0,1,0,1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,4,5,7,6,8] => {{1,2,3},{4},{5},{6,7},{8}}
=> ? = 4 - 1
[1,0,1,1,0,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0,1,0]
=> [2,1,4,5,6,7,3,8] => {{1,2},{3,4,5,6,7},{8}}
=> ? = 6 - 1
[1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,0,1,1,0,0]
=> [2,1,4,5,6,3,8,7] => {{1,2},{3,4,5,6},{7,8}}
=> ? = 6 - 1
[1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3,7,8,6] => ?
=> ? = 6 - 1
[1,0,1,1,0,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0,1,0,1,0]
=> [2,1,4,5,3,6,7,8] => {{1,2},{3,4,5},{6},{7},{8}}
=> ? = 4 - 1
[1,0,1,1,0,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,0,1,0,1,0,0]
=> [2,1,4,3,6,7,8,5] => {{1,2},{3,4},{5,6,7,8}}
=> ? = 6 - 1
[1,0,1,1,0,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> [2,1,4,3,5,6,8,7] => {{1,2},{3,4},{5},{6},{7,8}}
=> ? = 4 - 1
[1,0,1,1,1,0,0,0,1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,1,0,0,1,0,1,0]
=> [2,1,3,5,6,4,7,8] => ?
=> ? = 4 - 1
[1,0,1,1,1,0,0,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4,6,8,7] => {{1,2},{3},{4,5},{6},{7,8}}
=> ? = 4 - 1
[1,0,1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,5,4,6,7,8] => {{1,2},{3},{4,5},{6},{7},{8}}
=> ? = 3 - 1
[1,0,1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [2,1,3,4,6,7,8,5] => {{1,2},{3},{4},{5,6,7,8}}
=> ? = 5 - 1
[1,0,1,1,1,1,0,0,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,0,1,1,0,1,0,0,1,0]
=> [2,1,3,4,6,7,5,8] => ?
=> ? = 4 - 1
[1,0,1,1,1,1,0,0,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> [2,1,3,4,6,5,8,7] => {{1,2},{3},{4},{5,6},{7,8}}
=> ? = 4 - 1
[1,0,1,1,1,1,0,0,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [2,1,3,4,6,5,7,8] => {{1,2},{3},{4},{5,6},{7},{8}}
=> ? = 3 - 1
[1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0]
=> [1,3,4,5,6,7,2,8] => {{1},{2,3,4,5,6,7},{8}}
=> ? = 6 - 1
[1,1,0,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0,1,1,0,0]
=> [1,3,4,5,6,2,8,7] => {{1},{2,3,4,5,6},{7,8}}
=> ? = 6 - 1
[1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0,1,1,0,1,0,0]
=> [1,3,4,5,2,7,8,6] => {{1},{2,3,4,5},{6,7,8}}
=> ? = 6 - 1
[1,1,0,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2,6,7,8] => {{1},{2,3,4,5},{6},{7},{8}}
=> ? = 4 - 1
[1,1,0,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0,1,1,0,1,0,1,0,0]
=> [1,3,4,2,6,7,8,5] => {{1},{2,3,4},{5,6,7,8}}
=> ? = 6 - 1
[1,1,0,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,0,1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,6,7,8,4] => {{1},{2,3},{4,5,6,7,8}}
=> ? = 6 - 1
[1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4,7,6,8] => {{1},{2,3},{4,5},{6,7},{8}}
=> ? = 4 - 1
[1,1,0,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0,1,0]
=> [1,3,2,5,4,6,7,8] => {{1},{2,3},{4,5},{6},{7},{8}}
=> ? = 3 - 1
[1,1,0,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,1,0,1,0,0]
=> [1,3,2,4,5,7,8,6] => {{1},{2,3},{4},{5},{6,7,8}}
=> ? = 4 - 1
[1,1,0,0,1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0]
=> [1,3,2,4,5,7,6,8] => {{1},{2,3},{4},{5},{6,7},{8}}
=> ? = 3 - 1
[1,1,0,1,1,0,0,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,7,4,6,8] => {{1,2,3},{4,5,6,7},{8}}
=> ? = 6 - 1
[1,1,0,1,1,0,0,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0,1,1,1,0,0,0]
=> [3,1,2,5,4,8,6,7] => ?
=> ? = 6 - 1
[1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0,1,0,1,0]
=> [1,2,4,5,6,3,7,8] => {{1},{2},{3,4,5,6},{7},{8}}
=> ? = 4 - 1
[1,1,1,0,0,0,1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,2,4,5,3,6,8,7] => ?
=> ? = 4 - 1
[1,1,1,0,0,0,1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0,1,0,1,0]
=> [1,2,4,5,3,6,7,8] => ?
=> ? = 3 - 1
[1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,2,4,3,5,7,8,6] => {{1},{2},{3,4},{5},{6,7,8}}
=> ? = 4 - 1
[1,1,1,0,0,0,1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,2,4,3,5,6,8,7] => {{1},{2},{3,4},{5},{6},{7,8}}
=> ? = 3 - 1
[1,1,1,0,0,1,0,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,1,1,0,0,0,1,0]
=> [1,4,2,5,7,3,6,8] => {{1},{2,3,4,5,6,7},{8}}
=> ? = 6 - 1
[1,1,1,0,1,0,0,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,1,1,0,1,0,0,0]
=> [3,4,1,5,7,8,2,6] => {{1,3},{2,4,5,7},{6,8}}
=> ? = 6 - 1
[1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,2,3,5,6,7,8,4] => {{1},{2},{3},{4,5,6,7,8}}
=> ? = 5 - 1
[1,1,1,1,0,0,0,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,2,3,5,6,7,4,8] => {{1},{2},{3},{4,5,6,7},{8}}
=> ? = 4 - 1
[1,1,1,1,0,0,0,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,2,3,5,6,4,8,7] => {{1},{2},{3},{4,5,6},{7,8}}
=> ? = 4 - 1
[1,1,1,1,0,0,0,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,2,3,5,6,4,7,8] => {{1},{2},{3},{4,5,6},{7},{8}}
=> ? = 3 - 1
[1,1,1,1,0,0,0,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,2,3,5,4,7,8,6] => {{1},{2},{3},{4,5},{6,7,8}}
=> ? = 4 - 1
[1,1,1,1,0,0,0,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,2,3,5,4,7,6,8] => {{1},{2},{3},{4,5},{6,7},{8}}
=> ? = 3 - 1
Description
The rank of the set partition.
This is defined as the number of elements in the set partition minus the number of blocks, or, equivalently, the number of arcs in the one-line diagram associated to the set partition.
Matching statistic: St001330
(load all 15 compositions to match this statistic)
(load all 15 compositions to match this statistic)
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St001330: Graphs ⟶ ℤResult quality: 77% ●values known / values provided: 77%●distinct values known / distinct values provided: 100%
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St001330: Graphs ⟶ ℤResult quality: 77% ●values known / values provided: 77%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => ([],1)
=> ([],1)
=> 1
[1,0,1,0]
=> [2,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> 2
[1,1,0,0]
=> [1,2] => ([],2)
=> ([],1)
=> 1
[1,0,1,0,1,0]
=> [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
[1,1,0,0,1,0]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
[1,1,1,0,0,0]
=> [1,2,3] => ([],3)
=> ([],1)
=> 1
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => ([(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)
=> 4
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 2
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([],4)
=> ([],1)
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => ([(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)
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,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),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,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),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,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),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => ([(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),(1,2),(1,3),(2,3)],4)
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,1,1,0,0,0,1,1,0,0]
=> [4,5,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,1,1,0,0,0,0,1,0]
=> [5,1,2,3,4] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,2,1] => ([(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)
=> ([(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)
=> 6
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [5,6,4,3,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [6,4,5,3,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [5,4,6,3,2,1] => ([(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)
=> ([(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)
=> ? = 6
[1,0,1,0,1,0,1,1,1,0,0,0]
=> [4,5,6,3,2,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [6,5,3,4,2,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [5,6,3,4,2,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [6,4,3,5,2,1] => ([(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)
=> ([(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)
=> ? = 6
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [6,3,4,5,2,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,1,1,0,0,0,0]
=> [3,4,5,6,2,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,3,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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [5,6,4,2,3,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [6,4,5,2,3,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [4,5,6,2,3,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,4,1] => ([(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)
=> ([(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)
=> ? = 6
[1,0,1,1,1,0,0,0,1,0,1,0]
=> [6,5,2,3,4,1] => ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [5,6,2,3,4,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [6,2,3,4,5,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,1,2] => ([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [5,6,4,3,1,2] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [6,4,5,3,1,2] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,1,3] => ([(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)
=> ([(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)
=> ? = 6
[1,1,0,1,0,0,1,1,0,1,0,0]
=> [5,4,6,2,1,3] => ([(0,1),(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 6
[1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [6,5,7,4,3,2,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,0,1,0,1,0,1,1,0,1,0,0,1,0]
=> [7,5,4,6,3,2,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [6,5,4,7,3,2,1] => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,0,1,0,1,0,1,1,0,1,1,0,0,0]
=> [5,6,4,7,3,2,1] => ([(0,4),(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [6,4,5,7,3,2,1] => ([(0,4),(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> [5,4,6,7,3,2,1] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,0,1,0,1,1,0,0,1,1,0,1,0,0]
=> [6,5,7,3,4,2,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,0,1,0,1,1,0,1,0,0,1,0,1,0]
=> [7,6,4,3,5,2,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,0,1,0,1,1,0,1,0,0,1,1,0,0]
=> [6,7,4,3,5,2,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,0,1,0,1,1,0,1,0,1,0,0,1,0]
=> [7,5,4,3,6,2,1] => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,0,1,0,1,1,0,1,1,0,0,0,1,0]
=> [7,4,5,3,6,2,1] => ([(0,4),(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,0,1,0,1,1,1,0,0,1,0,0,1,0]
=> [7,5,3,4,6,2,1] => ([(0,4),(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,0,1,0,1,1,1,0,1,0,0,0,1,0]
=> [7,4,3,5,6,2,1] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,0,1,1,0,0,1,0,1,1,0,1,0,0]
=> [6,5,7,4,2,3,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,0,1,1,0,0,1,1,0,1,0,0,1,0]
=> [7,5,4,6,2,3,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,0,1,1,0,1,0,0,1,0,1,0,1,0]
=> [7,6,5,3,2,4,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,0,1,1,0,1,0,0,1,0,1,1,0,0]
=> [6,7,5,3,2,4,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,0,1,1,0,1,0,0,1,1,0,0,1,0]
=> [7,5,6,3,2,4,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,0,1,1,0,1,0,0,1,1,0,1,0,0]
=> [6,5,7,3,2,4,1] => ([(0,1),(0,4),(0,5),(0,6),(1,2),(1,3),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,4),(0,5),(0,6),(1,2),(1,3),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,0,1,1,0,1,0,1,0,0,1,0,1,0]
=> [7,6,4,3,2,5,1] => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,0,1,1,0,1,1,0,0,0,1,0,1,0]
=> [7,6,3,4,2,5,1] => ([(0,4),(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,0,1,1,1,0,0,1,0,0,1,0,1,0]
=> [7,6,4,2,3,5,1] => ([(0,4),(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,0,1,1,1,0,1,0,0,0,1,0,1,0]
=> [7,6,3,2,4,5,1] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,1,0,0,1,0,1,0,1,1,0,1,0,0]
=> [6,5,7,4,3,1,2] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,1,0,0,1,0,1,1,0,1,0,0,1,0]
=> [7,5,4,6,3,1,2] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,1,0,0,1,1,0,1,0,0,1,0,1,0]
=> [7,6,4,3,5,1,2] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,2,1,3] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,1,0,1,0,0,1,0,1,0,1,1,0,0]
=> [6,7,5,4,2,1,3] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,1,0,1,0,0,1,0,1,1,0,0,1,0]
=> [7,5,6,4,2,1,3] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,1,0,1,0,0,1,0,1,1,0,1,0,0]
=> [6,5,7,4,2,1,3] => ([(0,1),(0,4),(0,5),(0,6),(1,2),(1,3),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,4),(0,5),(0,6),(1,2),(1,3),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,1,0,1,0,0,1,1,0,0,1,0,1,0]
=> [7,6,4,5,2,1,3] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,1,0,1,0,0,1,1,0,1,0,0,1,0]
=> [7,5,4,6,2,1,3] => ([(0,1),(0,4),(0,5),(0,6),(1,2),(1,3),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,4),(0,5),(0,6),(1,2),(1,3),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,1,0,1,0,0,1,1,0,1,0,1,0,0]
=> [6,5,4,7,2,1,3] => ([(0,1),(0,5),(0,6),(1,2),(1,3),(1,4),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,5),(0,6),(1,2),(1,3),(1,4),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,1,0,1,0,0,1,1,0,1,1,0,0,0]
=> [5,6,4,7,2,1,3] => ([(0,3),(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 6
[1,1,0,1,0,0,1,1,1,0,0,1,0,0]
=> [6,4,5,7,2,1,3] => ([(0,3),(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 6
[1,1,0,1,0,0,1,1,1,0,1,0,0,0]
=> [5,4,6,7,2,1,3] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(5,6)],7)
=> ([(0,1),(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 6
[1,1,0,1,0,1,0,0,1,0,1,0,1,0]
=> [7,6,5,3,2,1,4] => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,1,0,1,0,1,0,0,1,1,0,1,0,0]
=> [6,5,7,3,2,1,4] => ([(0,1),(0,5),(0,6),(1,2),(1,3),(1,4),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,5),(0,6),(1,2),(1,3),(1,4),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 7
[1,1,0,1,1,0,0,0,1,0,1,0,1,0]
=> [7,6,5,2,3,1,4] => ([(0,4),(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,1,0,1,1,0,0,0,1,1,0,1,0,0]
=> [6,5,7,2,3,1,4] => ([(0,3),(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 6
[1,1,1,0,0,1,0,0,1,0,1,0,1,0]
=> [7,6,5,3,1,2,4] => ([(0,4),(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,1,1,0,0,1,0,0,1,1,0,1,0,0]
=> [6,5,7,3,1,2,4] => ([(0,3),(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 6
[1,1,1,0,1,0,0,0,1,0,1,0,1,0]
=> [7,6,5,2,1,3,4] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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)
=> ? = 6
[1,1,1,0,1,0,0,0,1,1,0,1,0,0]
=> [6,5,7,2,1,3,4] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(5,6)],7)
=> ([(0,1),(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 6
[1,1,0,1,1,0,0,0,1,1,0,1,1,0,0,0]
=> [6,7,5,8,2,3,1,4] => ([(0,1),(0,4),(0,5),(0,7),(1,2),(1,3),(1,6),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ([(0,1),(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 6
Description
The hat guessing number of a graph.
Suppose that each vertex of a graph corresponds to a player, wearing a hat whose color is arbitrarily chosen from a set of $q$ possible colors. Each player can see the hat colors of his neighbors, but not his own hat color. All of the players are asked to guess their own hat colors simultaneously, according to a predetermined guessing strategy and the hat colors they see, where no communication between them is allowed. The hat guessing number $HG(G)$ of a graph $G$ is the largest integer $q$ such that there exists a guessing strategy guaranteeing at least one correct guess for any hat assignment of $q$ possible colors.
Because it suffices that a single player guesses correctly, the hat guessing number of a graph is the maximum of the hat guessing numbers of its connected components.
The following 405 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000454The largest eigenvalue of a graph if it is integral. St001644The dimension of a graph. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001176The size of a partition minus its first part. St001812The biclique partition number of a graph. St000868The aid statistic in the sense of Shareshian-Wachs. St000288The number of ones in a binary word. St000225Difference between largest and smallest parts in a partition. St000159The number of distinct parts of the integer partition. St000733The row containing the largest entry of a standard tableau. St000019The cardinality of the support of a permutation. St001432The order dimension of the partition. St001033The normalized area of the parallelogram polyomino associated with the Dyck path. 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. St001558The number of transpositions that are smaller or equal to a permutation in Bruhat order. St001579The number of cyclically simple transpositions decreasing the number of cyclic descents needed to sort a permutation. St001726The number of visible inversions of a permutation. St000809The reduced reflection length of the permutation. St000957The number of Bruhat lower covers of a permutation. St001076The minimal length of a factorization of a permutation into transpositions that are cyclic shifts of (12). St001497The position of the largest weak excedence of a permutation. St000081The number of edges of a graph. St000054The first entry of the permutation. St000141The maximum drop size of a permutation. St000485The length of the longest cycle of a permutation. St000831The number of indices that are either descents or recoils. St000470The number of runs in a permutation. St000539The number of odd inversions of a permutation. St000956The maximal displacement of a permutation. St001397Number of pairs of incomparable elements in a finite poset. St001489The maximum of the number of descents and the number of inverse descents. St000795The mad of a permutation. St000354The number of recoils of a permutation. St000829The Ulam distance of a permutation to the identity permutation. St001061The number of indices that are both descents and recoils of a permutation. St000653The last descent of a permutation. St000740The last entry of a permutation. St000833The comajor index of a permutation. St000246The number of non-inversions of a permutation. St000067The inversion number of the alternating sign matrix. St000497The lcb statistic of a set partition. St000572The dimension exponent of a set partition. St000356The number of occurrences of the pattern 13-2. St001083The number of boxed occurrences of 132 in a permutation. St000065The number of entries equal to -1 in an alternating sign matrix. St000496The rcs statistic of a set partition. St000728The dimension of a set partition. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000332The positive inversions of an alternating sign matrix. St000730The maximal arc length of a set partition. St000491The number of inversions of a set partition. St000581The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 2 is maximal. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St000306The bounce count of a Dyck path. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St000066The column of the unique '1' in the first row of the alternating sign matrix. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St000029The depth of a permutation. St000024The number of double up and double down steps of a Dyck path. St000240The number of indices that are not small excedances. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St000004The major index of a permutation. St000030The sum of the descent differences of a permutations. St000224The sorting index of a permutation. St000238The number of indices that are not small weak excedances. St000316The number of non-left-to-right-maxima of a permutation. St000672The number of minimal elements in Bruhat order not less than the permutation. St001004The number of indices that are either left-to-right maxima or right-to-left minima. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001428The number of B-inversions of a signed permutation. St001843The Z-index of a set partition. St001869The maximum cut size of a graph. St000053The number of valleys of the Dyck path. St000325The width of the tree associated to a permutation. St000443The number of long tunnels of a Dyck path. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St000021The number of descents of a permutation. St000051The size of the left subtree of a binary tree. St000058The order of a permutation. St000133The "bounce" of a permutation. St000155The number of exceedances (also excedences) of a permutation. St000156The Denert index of a permutation. St000204The number of internal nodes of a binary tree. St000304The load of a permutation. St000305The inverse major index of a permutation. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001077The prefix exchange distance of a permutation. St001115The number of even descents of a permutation. St001126Number of simple module that are 1-regular in the corresponding Nakayama algebra. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001167The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra. St001203We associate to 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 Dyck path as follows:
St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001311The cyclomatic number of a graph. St001317The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the graph. St001328The minimal number of occurrences of the bipartite-pattern in a linear ordering of the vertices of the graph. St000969We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n-1}]$ by adding $c_0$ to $c_{n-1}$. St000998Number of indecomposable projective modules with injective dimension smaller than or equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001166Number of indecomposable projective non-injective modules with dominant dimension equal to the global dimension plus the number of indecomposable projective injective modules in the corresponding Nakayama algebra. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St000216The absolute length of a permutation. St001480The number of simple summands of the module J^2/J^3. St000167The number of leaves of an ordered tree. St000692Babson and Steingrímsson's statistic of a permutation. St000727The largest label of a leaf in the binary search tree associated with the permutation. St000996The number of exclusive left-to-right maxima of a permutation. St000318The number of addable cells of the Ferrers diagram of an integer partition. St001081The number of minimal length factorizations of a permutation into star transpositions. St000035The number of left outer peaks of a permutation. St000153The number of adjacent cycles of a permutation. St000237The number of small exceedances. St000245The number of ascents of a permutation. St000374The number of exclusive right-to-left minima of a permutation. St000742The number of big ascents of a permutation after prepending zero. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St001907The number of Bastidas - Hohlweg - Saliola excedances of a signed permutation. St000451The length of the longest pattern of the form k 1 2. St000834The number of right outer peaks of a permutation. St000871The number of very big ascents of a permutation. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. St000308The height of the tree associated to a permutation. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001037The number of inner corners of the upper path of the parallelogram polyomino associated with the Dyck path. St000619The number of cyclic descents of a permutation. St001277The degeneracy of a graph. St001298The number of repeated entries in the Lehmer code of a permutation. St001358The largest degree of a regular subgraph of a graph. St000365The number of double ascents of a permutation. St000654The first descent of a permutation. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001331The size of the minimal feedback vertex set. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001717The largest size of an interval in a poset. St001963The tree-depth of a graph. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St000528The height of a poset. St000912The number of maximal antichains in a poset. St001343The dimension of the reduced incidence algebra of a poset. St000002The number of occurrences of the pattern 123 in a permutation. St000018The number of inversions of a permutation. St000702The number of weak deficiencies of a permutation. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St000052The number of valleys of a Dyck path not on the x-axis. St000069The number of maximal elements of a poset. St000662The staircase size of the code of a permutation. St000647The number of big descents of a permutation. St001458The rank of the adjacency matrix of a graph. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St000223The number of nestings in the permutation. St000437The number of occurrences of the pattern 312 or of the pattern 321 in a permutation. St000711The number of big exceedences of a permutation. St000031The number of cycles in the cycle decomposition of a permutation. St000442The maximal area to the right of an up step of a Dyck path. St000787The number of flips required to make a perfect matching noncrossing. St000866The number of admissible inversions of a permutation in the sense of Shareshian-Wachs. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St000731The number of double exceedences of a permutation. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000703The number of deficiencies of a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St000355The number of occurrences of the pattern 21-3. St000436The number of occurrences of the pattern 231 or of the pattern 321 in a permutation. St000710The number of big deficiencies of a permutation. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St000340The number of non-final maximal constant sub-paths of length greater than one. St000836The number of descents of distance 2 of a permutation. St001727The number of invisible inversions of a permutation. St000989The number of final rises of a permutation. St000022The number of fixed points of a permutation. St000119The number of occurrences of the pattern 321 in a permutation. St000123The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. St000359The number of occurrences of the pattern 23-1. St000724The label of the leaf of the path following the smaller label in the increasing binary tree associated to a permutation. St000646The number of big ascents of a permutation. St000007The number of saliances of the permutation. St000358The number of occurrences of the pattern 31-2. St000648The number of 2-excedences of a permutation. St000840The number of closers smaller than the largest opener in a perfect matching. St000446The disorder of a permutation. St000028The number of stack-sorts needed to sort a permutation. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St000760The length of the longest strictly decreasing subsequence of parts of an integer composition. St000764The number of strong records in an integer composition. St001082The number of boxed occurrences of 123 in a permutation. St000157The number of descents of a standard tableau. St000164The number of short pairs. St000291The number of descents of a binary word. St000292The number of ascents of a binary word. St000390The number of runs of ones in a binary word. St000843The decomposition number of a perfect matching. St000767The number of runs in an integer composition. St000903The number of different parts of an integer composition. St000761The number of ascents in an integer composition. St000925The number of topologically connected components of a set partition. St000462The major index minus the number of excedences of a permutation. St000585The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal, (1,3) are consecutive in a block. St000015The number of peaks of a Dyck path. St000068The number of minimal elements in a poset. St000071The number of maximal chains in a poset. St000389The number of runs of ones of odd length in a binary word. St000527The width of the poset. St000991The number of right-to-left minima of a permutation. St000317The cycle descent number of a permutation. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St000542The number of left-to-right-minima of a permutation. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000746The number of pairs with odd minimum in a perfect matching. St000888The maximal sum of entries on a diagonal of an alternating sign matrix. St000892The maximal number of nonzero entries on a diagonal of an alternating sign matrix. St000990The first ascent of a permutation. St001430The number of positive entries in a signed permutation. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St000428The number of occurrences of the pattern 123 or of the pattern 213 in a permutation. St000798The makl of a permutation. St000864The number of circled entries of the shifted recording tableau of a permutation. St000895The number of ones on the main diagonal of an alternating sign matrix. St001133The smallest label in the subtree rooted at the sister of 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001134The largest label in the subtree rooted at the sister of 1 in the leaf labelled binary unordered tree associated with the perfect matching. St001377The major index minus the number of inversions of a permutation. St001461The number of topologically connected components of the chord diagram of a permutation. St000732The number of double deficiencies of a permutation. St000062The length of the longest increasing subsequence of the permutation. St000181The number of connected components of the Hasse diagram for the poset. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000213The number of weak exceedances (also weak excedences) of a permutation. St000239The number of small weak excedances. St000314The number of left-to-right-maxima of a permutation. St000328The maximum number of child nodes in a tree. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001202Call 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. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001589The nesting number of a perfect matching. St001671Haglund's hag of a permutation. St000039The number of crossings of a permutation. St000083The number of left oriented leafs of a binary tree except the first one. St000217The number of occurrences of the pattern 312 in a permutation. St000236The number of cyclical small weak excedances. St000331The number of upper interactions of a Dyck path. St000673The number of non-fixed points of a permutation. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. St001024Maximum of dominant dimensions of the simple 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. St001152The number of pairs with even minimum in a perfect matching. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001180Number of indecomposable injective modules with projective dimension at most 1. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. 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. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over 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. St001464The number of bases of the positroid corresponding to the permutation, with all fixed points counterclockwise. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001182Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St000056The decomposition (or block) number of a permutation. St000060The greater neighbor of the maximum. St000061The number of nodes on the left branch of a binary tree. St000080The rank of the poset. St000084The number of subtrees. St000105The number of blocks in the set partition. St000120The number of left tunnels of a Dyck path. St000166The depth minus 1 of an ordered tree. St000168The number of internal nodes of an ordered tree. St000199The column of the unique '1' in the last row of the alternating sign matrix. St000200The row of the unique '1' in the last column of the alternating sign matrix. St000280The size of the preimage of the map 'to labelling permutation' from Parking functions to Permutations. St000335The difference of lower and upper interactions. St000450The number of edges minus the number of vertices plus 2 of a graph. St000482The (zero)-forcing number of a graph. St000676The number of odd rises of a Dyck path. St000678The number of up steps after the last double rise of a Dyck path. St000778The metric dimension of a graph. St000822The Hadwiger number of the graph. St000846The maximal number of elements covering an element of a poset. St000924The number of topologically connected components of a perfect matching. St000931The number of occurrences of the pattern UUU in a Dyck path. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001046The maximal number of arcs nesting a given arc of a perfect matching. St001058The breadth of the ordered tree. 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$. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001235The global dimension of the corresponding Comp-Nakayama algebra. 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. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001427The number of descents of a signed permutation. St001498The normalised height of a Nakayama algebra with magnitude 1. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001590The crossing number of a perfect matching. St001693The excess length of a longest path consisting of elements and blocks of a set partition. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000094The depth of an ordered tree. St000095The number of triangles of a graph. St000144The pyramid weight of the Dyck path. St000171The degree of the graph. St000222The number of alignments in the permutation. St000235The number of indices that are not cyclical small weak excedances. St000241The number of cyclical small excedances. St000242The number of indices that are not cyclical small weak excedances. St000286The number of connected components of the complement of a graph. St000297The number of leading ones in a binary word. St000299The number of nonisomorphic vertex-induced subtrees. St000367The number of simsun double descents of a permutation. St000392The length of the longest run of ones in a binary word. St000423The number of occurrences of the pattern 123 or of the pattern 132 in a permutation. St000507The number of ascents of a standard tableau. St000632The jump number of the poset. St000636The hull number of a graph. St000720The size of the largest partition in the oscillating tableau corresponding to the perfect matching. St000799The number of occurrences of the vincular pattern |213 in a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000838The number of terminal right-hand endpoints when the vertices are written in order. St000874The position of the last double rise in a Dyck path. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St000982The length of the longest constant subword. St001118The acyclic chromatic index of a graph. 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. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001297The number of indecomposable non-injective projective modules minus the number of indecomposable non-injective projective modules that have reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001346The number of parking functions that give the same permutation. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001372The length of a longest cyclic run of ones of a binary word. St001411The number of patterns 321 or 3412 in a permutation. St001429The number of negative entries in a signed permutation. St001511The minimal number of transpositions needed to sort a permutation in either direction. St001552The number of inversions between excedances and fixed points of a permutation. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St001684The reduced word complexity of a permutation. St001810The number of fixed points of a permutation smaller than its largest moved point. St001883The mutual visibility number of a graph. St000025The number of initial rises of a Dyck path. St000444The length of the maximal rise of a Dyck path. St000675The number of centered multitunnels of a Dyck path. St000738The first entry in the last row of a standard tableau. St001674The number of vertices of the largest induced star graph in the graph. St001809The index of the step at the first peak of maximal height in a Dyck path. St000898The number of maximal entries in the last diagonal of the monotone triangle. St001668The number of points of the poset minus the width of the poset. St000219The number of occurrences of the pattern 231 in a permutation. St000327The number of cover relations in a poset. St001570The minimal number of edges to add to make a graph Hamiltonian. St001948The number of augmented double ascents of a permutation. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001960The number of descents of a permutation minus one if its first entry is not one. St001863The number of weak excedances of a signed permutation. St001889The size of the connectivity set of a signed permutation. St001769The reflection length of a signed permutation. St001861The number of Bruhat lower covers of a permutation. St001864The number of excedances of a signed permutation. St001894The depth of a signed permutation. St000383The last part of an integer composition. St000665The number of rafts of a permutation. St000381The largest part of an integer composition. St000546The number of global descents of a permutation. St000884The number of isolated descents of a permutation. St000896The number of zeros on the main diagonal of an alternating sign matrix. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St001862The number of crossings of a signed permutation. St001866The nesting alignments of a signed permutation. St001896The number of right descents of a signed permutations. St000089The absolute variation of a composition. St000011The number of touch points (or returns) of a Dyck path. St001596The number of two-by-two squares inside a skew partition. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset.
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!