searching the database
Your data matches 202 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 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00071: Permutations ādescent compositionā¶ Integer compositions
Mp00184: Integer compositions āto threshold graphā¶ Graphs
Mp00247: Graphs āde-duplicateā¶ Graphs
St000722: Graphs ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00184: Integer compositions āto threshold graphā¶ 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] => [1] => ([],1)
=> ([],1)
=> 1
[1,2] => [2] => ([],2)
=> ([],1)
=> 1
[2,1] => [1,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> 2
[1,2,3] => [3] => ([],3)
=> ([],1)
=> 1
[1,3,2] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
[2,3,1] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
[3,2,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,2,3,4] => [4] => ([],4)
=> ([],1)
=> 1
[1,2,4,3] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[1,3,4,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[1,4,3,2] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[2,3,4,1] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[2,4,3,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[3,4,2,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[4,3,2,1] => [1,1,1,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,2,3,4,5] => [5] => ([],5)
=> ([],1)
=> 1
[1,2,3,5,4] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,2,4,5,3] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,2,5,4,3] => [3,1,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,3,4,5,2] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,3,5,4,2] => [3,1,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,4,5,3,2] => [3,1,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,5,4,3,2] => [2,1,1,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
[2,3,4,5,1] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[2,3,5,4,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[2,4,5,3,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[2,5,4,3,1] => [2,1,1,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
[3,4,5,2,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[3,5,4,2,1] => [2,1,1,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
[4,5,3,2,1] => [2,1,1,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
[5,4,3,2,1] => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,2,3,4,5,6] => [6] => ([],6)
=> ([],1)
=> 1
[1,2,3,4,6,5] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
[1,2,3,5,6,4] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
[1,2,3,6,5,4] => [4,1,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,2,4,5,6,3] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
[1,2,4,6,5,3] => [4,1,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,2,5,6,4,3] => [4,1,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,2,6,5,4,3] => [3,1,1,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,3,4,5,6,2] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
[1,3,4,6,5,2] => [4,1,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,3,5,6,4,2] => [4,1,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,3,6,5,4,2] => [3,1,1,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,4,5,6,3,2] => [4,1,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,4,6,5,3,2] => [3,1,1,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,5,6,4,3,2] => [3,1,1,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,6,5,4,3,2] => [2,1,1,1,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
[2,1,6,5,4,3] => [1,2,1,1,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
[2,3,4,5,6,1] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
[2,3,4,6,5,1] => [4,1,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
Description
The number of different neighbourhoods in a graph.
Matching statistic: St001645
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00071: Permutations ādescent compositionā¶ Integer compositions
Mp00184: Integer compositions āto threshold graphā¶ Graphs
Mp00247: Graphs āde-duplicateā¶ Graphs
St001645: Graphs ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00184: Integer compositions āto threshold graphā¶ 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] => [1] => ([],1)
=> ([],1)
=> 1
[1,2] => [2] => ([],2)
=> ([],1)
=> 1
[2,1] => [1,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> 2
[1,2,3] => [3] => ([],3)
=> ([],1)
=> 1
[1,3,2] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
[2,3,1] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
[3,2,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,2,3,4] => [4] => ([],4)
=> ([],1)
=> 1
[1,2,4,3] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[1,3,4,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[1,4,3,2] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[2,3,4,1] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[2,4,3,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[3,4,2,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[4,3,2,1] => [1,1,1,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,2,3,4,5] => [5] => ([],5)
=> ([],1)
=> 1
[1,2,3,5,4] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,2,4,5,3] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,2,5,4,3] => [3,1,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,3,4,5,2] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,3,5,4,2] => [3,1,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,4,5,3,2] => [3,1,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,5,4,3,2] => [2,1,1,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
[2,3,4,5,1] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[2,3,5,4,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[2,4,5,3,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[2,5,4,3,1] => [2,1,1,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
[3,4,5,2,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[3,5,4,2,1] => [2,1,1,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
[4,5,3,2,1] => [2,1,1,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
[5,4,3,2,1] => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,2,3,4,5,6] => [6] => ([],6)
=> ([],1)
=> 1
[1,2,3,4,6,5] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
[1,2,3,5,6,4] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
[1,2,3,6,5,4] => [4,1,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,2,4,5,6,3] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
[1,2,4,6,5,3] => [4,1,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,2,5,6,4,3] => [4,1,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,2,6,5,4,3] => [3,1,1,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,3,4,5,6,2] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
[1,3,4,6,5,2] => [4,1,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,3,5,6,4,2] => [4,1,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,3,6,5,4,2] => [3,1,1,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,4,5,6,3,2] => [4,1,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,4,6,5,3,2] => [3,1,1,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,5,6,4,3,2] => [3,1,1,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,6,5,4,3,2] => [2,1,1,1,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
[2,1,6,5,4,3] => [1,2,1,1,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
[2,3,4,5,6,1] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
[2,3,4,6,5,1] => [4,1,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
Description
The pebbling number of a connected graph.
Matching statistic: St001707
Mp00071: Permutations ādescent compositionā¶ Integer compositions
Mp00184: Integer compositions āto threshold graphā¶ Graphs
Mp00247: Graphs āde-duplicateā¶ Graphs
St001707: Graphs ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00184: Integer compositions āto threshold graphā¶ 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] => [1] => ([],1)
=> ([],1)
=> 1
[1,2] => [2] => ([],2)
=> ([],1)
=> 1
[2,1] => [1,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> 2
[1,2,3] => [3] => ([],3)
=> ([],1)
=> 1
[1,3,2] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
[2,3,1] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
[3,2,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,2,3,4] => [4] => ([],4)
=> ([],1)
=> 1
[1,2,4,3] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[1,3,4,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[1,4,3,2] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[2,3,4,1] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[2,4,3,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[3,4,2,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[4,3,2,1] => [1,1,1,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,2,3,4,5] => [5] => ([],5)
=> ([],1)
=> 1
[1,2,3,5,4] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,2,4,5,3] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,2,5,4,3] => [3,1,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,3,4,5,2] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,3,5,4,2] => [3,1,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,4,5,3,2] => [3,1,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,5,4,3,2] => [2,1,1,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
[2,3,4,5,1] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[2,3,5,4,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[2,4,5,3,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[2,5,4,3,1] => [2,1,1,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
[3,4,5,2,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[3,5,4,2,1] => [2,1,1,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
[4,5,3,2,1] => [2,1,1,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
[5,4,3,2,1] => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,2,3,4,5,6] => [6] => ([],6)
=> ([],1)
=> 1
[1,2,3,4,6,5] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
[1,2,3,5,6,4] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
[1,2,3,6,5,4] => [4,1,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,2,4,5,6,3] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
[1,2,4,6,5,3] => [4,1,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,2,5,6,4,3] => [4,1,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,2,6,5,4,3] => [3,1,1,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,3,4,5,6,2] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
[1,3,4,6,5,2] => [4,1,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,3,5,6,4,2] => [4,1,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,3,6,5,4,2] => [3,1,1,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,4,5,6,3,2] => [4,1,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,4,6,5,3,2] => [3,1,1,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,5,6,4,3,2] => [3,1,1,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,6,5,4,3,2] => [2,1,1,1,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
[2,1,6,5,4,3] => [1,2,1,1,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
[2,3,4,5,6,1] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
[2,3,4,6,5,1] => [4,1,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
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
Mp00071: Permutations ādescent compositionā¶ Integer compositions
Mp00184: Integer compositions āto threshold graphā¶ Graphs
Mp00247: Graphs āde-duplicateā¶ Graphs
St001746: Graphs ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00184: Integer compositions āto threshold graphā¶ 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] => [1] => ([],1)
=> ([],1)
=> 1
[1,2] => [2] => ([],2)
=> ([],1)
=> 1
[2,1] => [1,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> 2
[1,2,3] => [3] => ([],3)
=> ([],1)
=> 1
[1,3,2] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
[2,3,1] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
[3,2,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[1,2,3,4] => [4] => ([],4)
=> ([],1)
=> 1
[1,2,4,3] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[1,3,4,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[1,4,3,2] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[2,3,4,1] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
[2,4,3,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[3,4,2,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[4,3,2,1] => [1,1,1,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,2,3,4,5] => [5] => ([],5)
=> ([],1)
=> 1
[1,2,3,5,4] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,2,4,5,3] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,2,5,4,3] => [3,1,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,3,4,5,2] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[1,3,5,4,2] => [3,1,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,4,5,3,2] => [3,1,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,5,4,3,2] => [2,1,1,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
[2,3,4,5,1] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
[2,3,5,4,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[2,4,5,3,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[2,5,4,3,1] => [2,1,1,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
[3,4,5,2,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
[3,5,4,2,1] => [2,1,1,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
[4,5,3,2,1] => [2,1,1,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
[5,4,3,2,1] => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,2,3,4,5,6] => [6] => ([],6)
=> ([],1)
=> 1
[1,2,3,4,6,5] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
[1,2,3,5,6,4] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
[1,2,3,6,5,4] => [4,1,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,2,4,5,6,3] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
[1,2,4,6,5,3] => [4,1,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,2,5,6,4,3] => [4,1,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,2,6,5,4,3] => [3,1,1,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,3,4,5,6,2] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
[1,3,4,6,5,2] => [4,1,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,3,5,6,4,2] => [4,1,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,3,6,5,4,2] => [3,1,1,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,4,5,6,3,2] => [4,1,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,4,6,5,3,2] => [3,1,1,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,5,6,4,3,2] => [3,1,1,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,6,5,4,3,2] => [2,1,1,1,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
[2,1,6,5,4,3] => [1,2,1,1,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
[2,3,4,5,6,1] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 2
[2,3,4,6,5,1] => [4,1,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
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: St000171
Mp00071: Permutations ādescent compositionā¶ Integer compositions
Mp00184: Integer compositions āto threshold graphā¶ Graphs
Mp00247: Graphs āde-duplicateā¶ Graphs
St000171: Graphs ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00184: Integer compositions āto threshold graphā¶ Graphs
Mp00247: Graphs āde-duplicateā¶ Graphs
St000171: Graphs ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1] => [1] => ([],1)
=> ([],1)
=> 0 = 1 - 1
[1,2] => [2] => ([],2)
=> ([],1)
=> 0 = 1 - 1
[2,1] => [1,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,2,3] => [3] => ([],3)
=> ([],1)
=> 0 = 1 - 1
[1,3,2] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1 = 2 - 1
[2,3,1] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1 = 2 - 1
[3,2,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,2,3,4] => [4] => ([],4)
=> ([],1)
=> 0 = 1 - 1
[1,2,4,3] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,3,4,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,4,3,2] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[2,3,4,1] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1 = 2 - 1
[2,4,3,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[3,4,2,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[4,3,2,1] => [1,1,1,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,2,3,4,5] => [5] => ([],5)
=> ([],1)
=> 0 = 1 - 1
[1,2,3,5,4] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,2,4,5,3] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,2,5,4,3] => [3,1,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,3,4,5,2] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,3,5,4,2] => [3,1,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,4,5,3,2] => [3,1,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,5,4,3,2] => [2,1,1,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
[2,3,4,5,1] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1 = 2 - 1
[2,3,5,4,1] => [3,1,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
[2,4,5,3,1] => [3,1,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
[2,5,4,3,1] => [2,1,1,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
[3,4,5,2,1] => [3,1,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
[3,5,4,2,1] => [2,1,1,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
[4,5,3,2,1] => [2,1,1,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
[5,4,3,2,1] => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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,2,3,4,5,6] => [6] => ([],6)
=> ([],1)
=> 0 = 1 - 1
[1,2,3,4,6,5] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,2,3,5,6,4] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,2,3,6,5,4] => [4,1,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,2,4,5,6,3] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,2,4,6,5,3] => [4,1,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,2,5,6,4,3] => [4,1,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,2,6,5,4,3] => [3,1,1,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,3,4,5,6,2] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,3,4,6,5,2] => [4,1,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,3,5,6,4,2] => [4,1,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,3,6,5,4,2] => [3,1,1,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,4,5,6,3,2] => [4,1,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,4,6,5,3,2] => [3,1,1,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,5,6,4,3,2] => [3,1,1,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,6,5,4,3,2] => [2,1,1,1,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
[2,1,6,5,4,3] => [1,2,1,1,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
[2,3,4,5,6,1] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 1 = 2 - 1
[2,3,4,6,5,1] => [4,1,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
Description
The degree of the graph.
This is the maximal vertex degree of a graph.
Matching statistic: St000987
Mp00071: Permutations ādescent compositionā¶ Integer compositions
Mp00184: Integer compositions āto threshold graphā¶ Graphs
Mp00247: Graphs āde-duplicateā¶ Graphs
St000987: Graphs ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00184: Integer compositions āto threshold graphā¶ 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] => [1] => ([],1)
=> ([],1)
=> 0 = 1 - 1
[1,2] => [2] => ([],2)
=> ([],1)
=> 0 = 1 - 1
[2,1] => [1,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,2,3] => [3] => ([],3)
=> ([],1)
=> 0 = 1 - 1
[1,3,2] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1 = 2 - 1
[2,3,1] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1 = 2 - 1
[3,2,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,2,3,4] => [4] => ([],4)
=> ([],1)
=> 0 = 1 - 1
[1,2,4,3] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,3,4,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,4,3,2] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[2,3,4,1] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1 = 2 - 1
[2,4,3,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[3,4,2,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[4,3,2,1] => [1,1,1,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,2,3,4,5] => [5] => ([],5)
=> ([],1)
=> 0 = 1 - 1
[1,2,3,5,4] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,2,4,5,3] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,2,5,4,3] => [3,1,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,3,4,5,2] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,3,5,4,2] => [3,1,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,4,5,3,2] => [3,1,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,5,4,3,2] => [2,1,1,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
[2,3,4,5,1] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1 = 2 - 1
[2,3,5,4,1] => [3,1,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
[2,4,5,3,1] => [3,1,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
[2,5,4,3,1] => [2,1,1,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
[3,4,5,2,1] => [3,1,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
[3,5,4,2,1] => [2,1,1,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
[4,5,3,2,1] => [2,1,1,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
[5,4,3,2,1] => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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,2,3,4,5,6] => [6] => ([],6)
=> ([],1)
=> 0 = 1 - 1
[1,2,3,4,6,5] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,2,3,5,6,4] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,2,3,6,5,4] => [4,1,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,2,4,5,6,3] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,2,4,6,5,3] => [4,1,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,2,5,6,4,3] => [4,1,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,2,6,5,4,3] => [3,1,1,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,3,4,5,6,2] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,3,4,6,5,2] => [4,1,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,3,5,6,4,2] => [4,1,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,3,6,5,4,2] => [3,1,1,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,4,5,6,3,2] => [4,1,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,4,6,5,3,2] => [3,1,1,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,5,6,4,3,2] => [3,1,1,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,6,5,4,3,2] => [2,1,1,1,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
[2,1,6,5,4,3] => [1,2,1,1,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
[2,3,4,5,6,1] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 1 = 2 - 1
[2,3,4,6,5,1] => [4,1,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
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
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00071: Permutations ādescent compositionā¶ Integer compositions
Mp00184: Integer compositions āto threshold graphā¶ Graphs
Mp00247: Graphs āde-duplicateā¶ Graphs
St001120: Graphs ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00184: Integer compositions āto threshold graphā¶ 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] => [1] => ([],1)
=> ([],1)
=> 0 = 1 - 1
[1,2] => [2] => ([],2)
=> ([],1)
=> 0 = 1 - 1
[2,1] => [1,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,2,3] => [3] => ([],3)
=> ([],1)
=> 0 = 1 - 1
[1,3,2] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1 = 2 - 1
[2,3,1] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1 = 2 - 1
[3,2,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,2,3,4] => [4] => ([],4)
=> ([],1)
=> 0 = 1 - 1
[1,2,4,3] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,3,4,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,4,3,2] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[2,3,4,1] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1 = 2 - 1
[2,4,3,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[3,4,2,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[4,3,2,1] => [1,1,1,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,2,3,4,5] => [5] => ([],5)
=> ([],1)
=> 0 = 1 - 1
[1,2,3,5,4] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,2,4,5,3] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,2,5,4,3] => [3,1,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,3,4,5,2] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,3,5,4,2] => [3,1,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,4,5,3,2] => [3,1,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,5,4,3,2] => [2,1,1,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
[2,3,4,5,1] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1 = 2 - 1
[2,3,5,4,1] => [3,1,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
[2,4,5,3,1] => [3,1,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
[2,5,4,3,1] => [2,1,1,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
[3,4,5,2,1] => [3,1,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
[3,5,4,2,1] => [2,1,1,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
[4,5,3,2,1] => [2,1,1,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
[5,4,3,2,1] => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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,2,3,4,5,6] => [6] => ([],6)
=> ([],1)
=> 0 = 1 - 1
[1,2,3,4,6,5] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,2,3,5,6,4] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,2,3,6,5,4] => [4,1,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,2,4,5,6,3] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,2,4,6,5,3] => [4,1,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,2,5,6,4,3] => [4,1,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,2,6,5,4,3] => [3,1,1,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,3,4,5,6,2] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,3,4,6,5,2] => [4,1,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,3,5,6,4,2] => [4,1,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,3,6,5,4,2] => [3,1,1,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,4,5,6,3,2] => [4,1,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,4,6,5,3,2] => [3,1,1,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,5,6,4,3,2] => [3,1,1,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,6,5,4,3,2] => [2,1,1,1,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
[2,1,6,5,4,3] => [1,2,1,1,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
[2,3,4,5,6,1] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 1 = 2 - 1
[2,3,4,6,5,1] => [4,1,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
Description
The length of a longest path in a graph.
Matching statistic: St001268
Mp00071: Permutations ādescent compositionā¶ Integer compositions
Mp00184: Integer compositions āto threshold graphā¶ Graphs
Mp00243: Graphs āweak duplicate orderā¶ Posets
St001268: Posets ā¶ ā¤Result quality: 90% āvalues known / values provided: 90%ādistinct values known / distinct values provided: 100%
Mp00184: Integer compositions āto threshold graphā¶ Graphs
Mp00243: Graphs āweak duplicate orderā¶ Posets
St001268: Posets ā¶ ā¤Result quality: 90% āvalues known / values provided: 90%ādistinct values known / distinct values provided: 100%
Values
[1] => [1] => ([],1)
=> ([],1)
=> 1
[1,2] => [2] => ([],2)
=> ([],1)
=> 1
[2,1] => [1,1] => ([(0,1)],2)
=> ([],2)
=> 2
[1,2,3] => [3] => ([],3)
=> ([],1)
=> 1
[1,3,2] => [2,1] => ([(0,2),(1,2)],3)
=> ([],2)
=> 2
[2,3,1] => [2,1] => ([(0,2),(1,2)],3)
=> ([],2)
=> 2
[3,2,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 3
[1,2,3,4] => [4] => ([],4)
=> ([],1)
=> 1
[1,2,4,3] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([],2)
=> 2
[1,3,4,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([],2)
=> 2
[1,4,3,2] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],3)
=> 3
[2,3,4,1] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([],2)
=> 2
[2,4,3,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],3)
=> 3
[3,4,2,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],3)
=> 3
[4,3,2,1] => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 4
[1,2,3,4,5] => [5] => ([],5)
=> ([],1)
=> 1
[1,2,3,5,4] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],2)
=> 2
[1,2,4,5,3] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],2)
=> 2
[1,2,5,4,3] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],3)
=> 3
[1,3,4,5,2] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],2)
=> 2
[1,3,5,4,2] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],3)
=> 3
[1,4,5,3,2] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],3)
=> 3
[1,5,4,3,2] => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],4)
=> 4
[2,3,4,5,1] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],2)
=> 2
[2,3,5,4,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],3)
=> 3
[2,4,5,3,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],3)
=> 3
[2,5,4,3,1] => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],4)
=> 4
[3,4,5,2,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],3)
=> 3
[3,5,4,2,1] => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],4)
=> 4
[4,5,3,2,1] => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],4)
=> 4
[5,4,3,2,1] => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],5)
=> 5
[1,2,3,4,5,6] => [6] => ([],6)
=> ([],1)
=> 1
[1,2,3,4,6,5] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 2
[1,2,3,5,6,4] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 2
[1,2,3,6,5,4] => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],3)
=> 3
[1,2,4,5,6,3] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 2
[1,2,4,6,5,3] => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],3)
=> 3
[1,2,5,6,4,3] => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],3)
=> 3
[1,2,6,5,4,3] => [3,1,1,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)
=> ([],4)
=> 4
[1,3,4,5,6,2] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 2
[1,3,4,6,5,2] => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],3)
=> 3
[1,3,5,6,4,2] => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],3)
=> 3
[1,3,6,5,4,2] => [3,1,1,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)
=> ([],4)
=> 4
[1,4,5,6,3,2] => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],3)
=> 3
[1,4,6,5,3,2] => [3,1,1,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)
=> ([],4)
=> 4
[1,5,6,4,3,2] => [3,1,1,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)
=> ([],4)
=> 4
[1,6,5,4,3,2] => [2,1,1,1,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)
=> 5
[2,1,6,5,4,3] => [1,2,1,1,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)
=> ([(3,5),(4,5)],6)
=> 6
[2,3,4,5,6,1] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 2
[2,3,4,6,5,1] => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],3)
=> 3
[5,6,7,8,4,3,2,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[4,6,7,8,5,3,2,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[4,5,7,8,6,3,2,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[4,5,6,8,7,3,2,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[3,6,7,8,5,4,2,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[3,5,7,8,6,4,2,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[3,5,6,8,7,4,2,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[3,4,7,8,6,5,2,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[3,4,6,8,7,5,2,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[3,4,5,8,7,6,2,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[2,6,7,8,5,4,3,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[2,5,7,8,6,4,3,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[2,5,6,8,7,4,3,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[2,4,7,8,6,5,3,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[2,4,6,8,7,5,3,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[2,3,7,8,6,5,4,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[2,3,6,8,7,5,4,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[2,3,4,8,7,6,5,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,6,7,8,5,4,3,2] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,5,7,8,6,4,3,2] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,5,6,8,7,4,3,2] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,4,7,8,6,5,3,2] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,4,6,8,7,5,3,2] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,4,5,8,7,6,3,2] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,3,7,8,6,5,4,2] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,3,6,8,7,5,4,2] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,3,5,8,7,6,4,2] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,3,4,8,7,6,5,2] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,2,7,8,6,5,4,3] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,2,6,8,7,5,4,3] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,2,5,8,7,6,4,3] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,2,4,8,7,6,5,3] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,2,3,8,7,6,5,4] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
Description
The size of the largest ordinal summand in the poset.
The ordinal sum of two posets $P$ and $Q$ is the poset having elements $(p,0)$ and $(q,1)$ for $p\in P$ and $q\in Q$, and relations $(a,0) < (b,0)$ if $a < b$ in $P$, $(a,1) < (b,1)$ if $a < b$ in $Q$, and $(a,0) < (b,1)$.
This statistic is the maximal cardinality of a summand in the longest ordinal decomposition of a poset.
Matching statistic: St001636
Mp00071: Permutations ādescent compositionā¶ Integer compositions
Mp00184: Integer compositions āto threshold graphā¶ Graphs
Mp00243: Graphs āweak duplicate orderā¶ Posets
St001636: Posets ā¶ ā¤Result quality: 90% āvalues known / values provided: 90%ādistinct values known / distinct values provided: 100%
Mp00184: Integer compositions āto threshold graphā¶ Graphs
Mp00243: Graphs āweak duplicate orderā¶ Posets
St001636: Posets ā¶ ā¤Result quality: 90% āvalues known / values provided: 90%ādistinct values known / distinct values provided: 100%
Values
[1] => [1] => ([],1)
=> ([],1)
=> 1
[1,2] => [2] => ([],2)
=> ([],1)
=> 1
[2,1] => [1,1] => ([(0,1)],2)
=> ([],2)
=> 2
[1,2,3] => [3] => ([],3)
=> ([],1)
=> 1
[1,3,2] => [2,1] => ([(0,2),(1,2)],3)
=> ([],2)
=> 2
[2,3,1] => [2,1] => ([(0,2),(1,2)],3)
=> ([],2)
=> 2
[3,2,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 3
[1,2,3,4] => [4] => ([],4)
=> ([],1)
=> 1
[1,2,4,3] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([],2)
=> 2
[1,3,4,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([],2)
=> 2
[1,4,3,2] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],3)
=> 3
[2,3,4,1] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([],2)
=> 2
[2,4,3,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],3)
=> 3
[3,4,2,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],3)
=> 3
[4,3,2,1] => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 4
[1,2,3,4,5] => [5] => ([],5)
=> ([],1)
=> 1
[1,2,3,5,4] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],2)
=> 2
[1,2,4,5,3] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],2)
=> 2
[1,2,5,4,3] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],3)
=> 3
[1,3,4,5,2] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],2)
=> 2
[1,3,5,4,2] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],3)
=> 3
[1,4,5,3,2] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],3)
=> 3
[1,5,4,3,2] => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],4)
=> 4
[2,3,4,5,1] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],2)
=> 2
[2,3,5,4,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],3)
=> 3
[2,4,5,3,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],3)
=> 3
[2,5,4,3,1] => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],4)
=> 4
[3,4,5,2,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],3)
=> 3
[3,5,4,2,1] => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],4)
=> 4
[4,5,3,2,1] => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],4)
=> 4
[5,4,3,2,1] => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],5)
=> 5
[1,2,3,4,5,6] => [6] => ([],6)
=> ([],1)
=> 1
[1,2,3,4,6,5] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 2
[1,2,3,5,6,4] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 2
[1,2,3,6,5,4] => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],3)
=> 3
[1,2,4,5,6,3] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 2
[1,2,4,6,5,3] => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],3)
=> 3
[1,2,5,6,4,3] => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],3)
=> 3
[1,2,6,5,4,3] => [3,1,1,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)
=> ([],4)
=> 4
[1,3,4,5,6,2] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 2
[1,3,4,6,5,2] => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],3)
=> 3
[1,3,5,6,4,2] => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],3)
=> 3
[1,3,6,5,4,2] => [3,1,1,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)
=> ([],4)
=> 4
[1,4,5,6,3,2] => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],3)
=> 3
[1,4,6,5,3,2] => [3,1,1,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)
=> ([],4)
=> 4
[1,5,6,4,3,2] => [3,1,1,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)
=> ([],4)
=> 4
[1,6,5,4,3,2] => [2,1,1,1,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)
=> 5
[2,1,6,5,4,3] => [1,2,1,1,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)
=> ([(3,5),(4,5)],6)
=> 6
[2,3,4,5,6,1] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 2
[2,3,4,6,5,1] => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],3)
=> 3
[5,6,7,8,4,3,2,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[4,6,7,8,5,3,2,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[4,5,7,8,6,3,2,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[4,5,6,8,7,3,2,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[3,6,7,8,5,4,2,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[3,5,7,8,6,4,2,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[3,5,6,8,7,4,2,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[3,4,7,8,6,5,2,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[3,4,6,8,7,5,2,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[3,4,5,8,7,6,2,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[2,6,7,8,5,4,3,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[2,5,7,8,6,4,3,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[2,5,6,8,7,4,3,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[2,4,7,8,6,5,3,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[2,4,6,8,7,5,3,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[2,3,7,8,6,5,4,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[2,3,6,8,7,5,4,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[2,3,4,8,7,6,5,1] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,6,7,8,5,4,3,2] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,5,7,8,6,4,3,2] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,5,6,8,7,4,3,2] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,4,7,8,6,5,3,2] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,4,6,8,7,5,3,2] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,4,5,8,7,6,3,2] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,3,7,8,6,5,4,2] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,3,6,8,7,5,4,2] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,3,5,8,7,6,4,2] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,3,4,8,7,6,5,2] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,2,7,8,6,5,4,3] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,2,6,8,7,5,4,3] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,2,5,8,7,6,4,3] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,2,4,8,7,6,5,3] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
[1,2,3,8,7,6,5,4] => [4,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ? = 5
Description
The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset.
Matching statistic: St001504
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00061: Permutations āto increasing treeā¶ Binary trees
Mp00012: Binary trees āto Dyck path: up step, left tree, down step, right treeā¶ Dyck paths
Mp00028: Dyck paths āreverseā¶ Dyck paths
St001504: Dyck paths ā¶ ā¤Result quality: 90% āvalues known / values provided: 90%ādistinct values known / distinct values provided: 100%
Mp00012: Binary trees āto Dyck path: up step, left tree, down step, right treeā¶ Dyck paths
Mp00028: Dyck paths āreverseā¶ Dyck paths
St001504: Dyck paths ā¶ ā¤Result quality: 90% āvalues known / values provided: 90%ādistinct values known / distinct values provided: 100%
Values
[1] => [.,.]
=> [1,0]
=> [1,0]
=> 2 = 1 + 1
[1,2] => [.,[.,.]]
=> [1,0,1,0]
=> [1,0,1,0]
=> 2 = 1 + 1
[2,1] => [[.,.],.]
=> [1,1,0,0]
=> [1,1,0,0]
=> 3 = 2 + 1
[1,2,3] => [.,[.,[.,.]]]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 2 = 1 + 1
[1,3,2] => [.,[[.,.],.]]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 3 = 2 + 1
[2,3,1] => [[.,[.,.]],.]
=> [1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> 3 = 2 + 1
[3,2,1] => [[[.,.],.],.]
=> [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 4 = 3 + 1
[1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,2,4,3] => [.,[.,[[.,.],.]]]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,3,4,2] => [.,[[.,[.,.]],.]]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,4,3,2] => [.,[[[.,.],.],.]]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 4 = 3 + 1
[2,3,4,1] => [[.,[.,[.,.]]],.]
=> [1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[2,4,3,1] => [[.,[[.,.],.]],.]
=> [1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 4 = 3 + 1
[3,4,2,1] => [[[.,[.,.]],.],.]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 4 = 3 + 1
[4,3,2,1] => [[[[.,.],.],.],.]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 3 = 2 + 1
[1,2,4,5,3] => [.,[.,[[.,[.,.]],.]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,2,5,4,3] => [.,[.,[[[.,.],.],.]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,3,4,5,2] => [.,[[.,[.,[.,.]]],.]]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,3,5,4,2] => [.,[[.,[[.,.],.]],.]]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 4 = 3 + 1
[1,4,5,3,2] => [.,[[[.,[.,.]],.],.]]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 4 = 3 + 1
[1,5,4,3,2] => [.,[[[[.,.],.],.],.]]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 5 = 4 + 1
[2,3,4,5,1] => [[.,[.,[.,[.,.]]]],.]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[2,3,5,4,1] => [[.,[.,[[.,.],.]]],.]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 4 = 3 + 1
[2,4,5,3,1] => [[.,[[.,[.,.]],.]],.]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 4 = 3 + 1
[2,5,4,3,1] => [[.,[[[.,.],.],.]],.]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 5 = 4 + 1
[3,4,5,2,1] => [[[.,[.,[.,.]]],.],.]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 4 = 3 + 1
[3,5,4,2,1] => [[[.,[[.,.],.]],.],.]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 5 = 4 + 1
[4,5,3,2,1] => [[[[.,[.,.]],.],.],.]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 5 = 4 + 1
[5,4,3,2,1] => [[[[[.,.],.],.],.],.]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 6 = 5 + 1
[1,2,3,4,5,6] => [.,[.,[.,[.,[.,[.,.]]]]]]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,2,3,4,6,5] => [.,[.,[.,[.,[[.,.],.]]]]]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> 3 = 2 + 1
[1,2,3,5,6,4] => [.,[.,[.,[[.,[.,.]],.]]]]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> 3 = 2 + 1
[1,2,3,6,5,4] => [.,[.,[.,[[[.,.],.],.]]]]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,2,4,5,6,3] => [.,[.,[[.,[.,[.,.]]],.]]]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,2,4,6,5,3] => [.,[.,[[.,[[.,.],.]],.]]]
=> [1,0,1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,2,5,6,4,3] => [.,[.,[[[.,[.,.]],.],.]]]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,2,6,5,4,3] => [.,[.,[[[[.,.],.],.],.]]]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> 5 = 4 + 1
[1,3,4,5,6,2] => [.,[[.,[.,[.,[.,.]]]],.]]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,3,4,6,5,2] => [.,[[.,[.,[[.,.],.]]],.]]
=> [1,0,1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> 4 = 3 + 1
[1,3,5,6,4,2] => [.,[[.,[[.,[.,.]],.]],.]]
=> [1,0,1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> 4 = 3 + 1
[1,3,6,5,4,2] => [.,[[.,[[[.,.],.],.]],.]]
=> [1,0,1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> 5 = 4 + 1
[1,4,5,6,3,2] => [.,[[[.,[.,[.,.]]],.],.]]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> 4 = 3 + 1
[1,4,6,5,3,2] => [.,[[[.,[[.,.],.]],.],.]]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> 5 = 4 + 1
[1,5,6,4,3,2] => [.,[[[[.,[.,.]],.],.],.]]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> 5 = 4 + 1
[1,6,5,4,3,2] => [.,[[[[[.,.],.],.],.],.]]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 6 = 5 + 1
[2,1,6,5,4,3] => [[.,.],[[[[.,.],.],.],.]]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> 7 = 6 + 1
[2,3,4,5,6,1] => [[.,[.,[.,[.,[.,.]]]]],.]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[2,3,4,6,5,1] => [[.,[.,[.,[[.,.],.]]]],.]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> 4 = 3 + 1
[5,6,7,8,4,3,2,1] => [[[[[.,[.,[.,[.,.]]]],.],.],.],.]
=> [1,1,1,1,1,0,1,0,1,0,1,0,0,0,0,0]
=> [1,1,1,1,1,0,1,0,1,0,1,0,0,0,0,0]
=> ? = 5 + 1
[4,6,7,8,5,3,2,1] => ?
=> ?
=> ?
=> ? = 5 + 1
[4,5,7,8,6,3,2,1] => ?
=> ?
=> ?
=> ? = 5 + 1
[4,5,6,8,7,3,2,1] => [[[[.,[.,[.,[[.,.],.]]]],.],.],.]
=> [1,1,1,1,0,1,0,1,0,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,1,0,1,0,1,0,0,0,0]
=> ? = 5 + 1
[3,6,7,8,5,4,2,1] => ?
=> ?
=> ?
=> ? = 5 + 1
[3,5,7,8,6,4,2,1] => [[[.,[[.,[[.,[.,.]],.]],.]],.],.]
=> [1,1,1,0,1,1,0,1,1,0,1,0,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,1,0,0,1,0,0,0]
=> ? = 5 + 1
[3,5,6,8,7,4,2,1] => [[[.,[[.,[.,[[.,.],.]]],.]],.],.]
=> [1,1,1,0,1,1,0,1,0,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,1,0,1,0,0,1,0,0,0]
=> ? = 5 + 1
[3,4,7,8,6,5,2,1] => ?
=> ?
=> ?
=> ? = 5 + 1
[3,4,6,8,7,5,2,1] => ?
=> ?
=> ?
=> ? = 5 + 1
[3,4,5,8,7,6,2,1] => ?
=> ?
=> ?
=> ? = 5 + 1
[2,6,7,8,5,4,3,1] => [[.,[[[[.,[.,[.,.]]],.],.],.]],.]
=> [1,1,0,1,1,1,1,0,1,0,1,0,0,0,0,0]
=> [1,1,1,1,1,0,1,0,1,0,0,0,0,1,0,0]
=> ? = 5 + 1
[2,5,7,8,6,4,3,1] => ?
=> ?
=> ?
=> ? = 5 + 1
[2,5,6,8,7,4,3,1] => ?
=> ?
=> ?
=> ? = 5 + 1
[2,4,7,8,6,5,3,1] => [[.,[[.,[[[.,[.,.]],.],.]],.]],.]
=> [1,1,0,1,1,0,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,1,0,0,1,0,0]
=> ? = 5 + 1
[2,4,6,8,7,5,3,1] => [[.,[[.,[[.,[[.,.],.]],.]],.]],.]
=> [1,1,0,1,1,0,1,1,0,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,1,0,0,1,0,0]
=> ? = 5 + 1
[2,3,7,8,6,5,4,1] => ?
=> ?
=> ?
=> ? = 5 + 1
[2,3,6,8,7,5,4,1] => ?
=> ?
=> ?
=> ? = 5 + 1
[2,3,4,8,7,6,5,1] => [[.,[.,[.,[[[[.,.],.],.],.]]]],.]
=> [1,1,0,1,0,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,1,0,1,0,0]
=> ? = 5 + 1
[1,6,7,8,5,4,3,2] => [.,[[[[[.,[.,[.,.]]],.],.],.],.]]
=> [1,0,1,1,1,1,1,0,1,0,1,0,0,0,0,0]
=> [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
=> ? = 5 + 1
[1,5,7,8,6,4,3,2] => ?
=> ?
=> ?
=> ? = 5 + 1
[1,5,6,8,7,4,3,2] => ?
=> ?
=> ?
=> ? = 5 + 1
[1,4,7,8,6,5,3,2] => [.,[[[.,[[[.,[.,.]],.],.]],.],.]]
=> [1,0,1,1,1,0,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,1,0,0,0,1,0]
=> ? = 5 + 1
[1,4,6,8,7,5,3,2] => [.,[[[.,[[.,[[.,.],.]],.]],.],.]]
=> [1,0,1,1,1,0,1,1,0,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,1,0,0,0,1,0]
=> ? = 5 + 1
[1,4,5,8,7,6,3,2] => [.,[[[.,[.,[[[.,.],.],.]]],.],.]]
=> [1,0,1,1,1,0,1,0,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,1,0,1,0,0,0,1,0]
=> ? = 5 + 1
[1,3,7,8,6,5,4,2] => [.,[[.,[[[[.,[.,.]],.],.],.]],.]]
=> [1,0,1,1,0,1,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,1,0,0,1,0]
=> ? = 5 + 1
[1,3,6,8,7,5,4,2] => [.,[[.,[[[.,[[.,.],.]],.],.]],.]]
=> [1,0,1,1,0,1,1,1,0,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,1,0,0,1,0]
=> ? = 5 + 1
[1,3,5,8,7,6,4,2] => [.,[[.,[[.,[[[.,.],.],.]],.]],.]]
=> [1,0,1,1,0,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,1,0,0,1,0]
=> ? = 5 + 1
[1,3,4,8,7,6,5,2] => [.,[[.,[.,[[[[.,.],.],.],.]]],.]]
=> [1,0,1,1,0,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,1,0,0,1,0]
=> ? = 5 + 1
[1,2,7,8,6,5,4,3] => [.,[.,[[[[[.,[.,.]],.],.],.],.]]]
=> [1,0,1,0,1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0,1,0,1,0]
=> ? = 5 + 1
[1,2,6,8,7,5,4,3] => ?
=> ?
=> ?
=> ? = 5 + 1
[1,2,5,8,7,6,4,3] => [.,[.,[[[.,[[[.,.],.],.]],.],.]]]
=> [1,0,1,0,1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0,1,0,1,0]
=> ? = 5 + 1
[1,2,4,8,7,6,5,3] => [.,[.,[[.,[[[[.,.],.],.],.]],.]]]
=> [1,0,1,0,1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0,1,0,1,0]
=> ? = 5 + 1
[1,2,3,8,7,6,5,4] => [.,[.,[.,[[[[[.,.],.],.],.],.]]]]
=> [1,0,1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0]
=> ? = 5 + 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.
The following 192 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000656The number of cuts of a poset. St001725The harmonious chromatic number of a graph. St000189The number of elements in the poset. St000209Maximum difference of elements in cycles. St000844The size of the largest block in the direct sum decomposition of a permutation. St000831The number of indices that are either descents or recoils. St000957The number of Bruhat lower covers of a permutation. St000868The aid statistic in the sense of Shareshian-Wachs. St000956The maximal displacement of a permutation. St000019The cardinality of the support of a permutation. St001330The hat guessing number of a graph. St000454The largest eigenvalue of a graph if it is integral. St001644The dimension of a graph. St001812The biclique partition number of a graph. St000225Difference between largest and smallest parts in a partition. 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. St000809The reduced reflection length of the permutation. St001076The minimal length of a factorization of a permutation into transpositions that are cyclic shifts of (12). St001726The number of visible inversions of a permutation. St000181The number of connected components of the Hasse diagram for the poset. St000010The length of the partition. St000054The first entry of the permutation. St000141The maximum drop size of a permutation. St000653The last descent of a permutation. St000533The minimum of the number of parts and the size of the first part of an integer partition. St001033The normalized area of the parallelogram polyomino associated with the Dyck path. St001427The number of descents of a signed permutation. St000727The largest label of a leaf in the binary search tree associated with the permutation. St000159The number of distinct parts of the integer partition. St000501The size of the first part in the decomposition of a permutation. St000067The inversion number of the alternating sign matrix. 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. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. 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. 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. St000133The "bounce" of a permutation. St000224The sorting index of a permutation. St000238The number of indices that are not small weak excedances. St000304The load of a permutation. St000316The number of non-left-to-right-maxima of a permutation. St000797The stat`` of a permutation. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St001480The number of simple summands of the module J^2/J^3. St000216The absolute length of a permutation. St001432The order dimension of the partition. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000374The number of exclusive right-to-left minima of a permutation. St000703The number of deficiencies of a permutation. St000451The length of the longest pattern of the form k 1 2. St000264The girth of a graph, which is not a tree. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001277The degeneracy of a graph. St001358The largest degree of a regular subgraph of a graph. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001316The domatic number of a graph. St001331The size of the minimal feedback vertex set. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001458The rank of the adjacency matrix of a graph. St001717The largest size of an interval in a poset. St001963The tree-depth of a graph. St000840The number of closers smaller than the largest opener in a perfect matching. 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. St001298The number of repeated entries in the Lehmer code of a permutation. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000702The number of weak deficiencies of a permutation. St000740The last entry of a permutation. St001430The number of positive entries in a signed permutation. St000155The number of exceedances (also excedences) of a permutation. St000193The row of the unique '1' in the first column of the alternating sign matrix. 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. St000213The number of weak exceedances (also weak excedences) of a permutation. St000822The Hadwiger number of the graph. St001555The order of a signed permutation. St001589The nesting number of a perfect matching. St000443The number of long tunnels of a Dyck path. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001429The number of negative entries in a signed permutation. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001684The reduced word complexity of a permutation. St000015The number of peaks of a Dyck path. St000021The number of descents of a permutation. St000062The length of the longest increasing subsequence of the permutation. St000080The rank of the poset. St000083The number of left oriented leafs of a binary tree except the first one. St000120The number of left tunnels of a Dyck path. St000168The number of internal nodes of an ordered tree. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000310The minimal degree of a vertex of a graph. St000314The number of left-to-right-maxima of a permutation. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000331The number of upper interactions of a Dyck path. St000332The positive inversions of an alternating sign matrix. St000354The number of recoils of a permutation. St000619The number of cyclic descents of a permutation. St000798The makl of a permutation. St000829The Ulam distance of a permutation to the identity permutation. St000833The comajor index of a permutation. St000991The number of right-to-left minima of a permutation. St001046The maximal number of arcs nesting a given arc of a perfect matching. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. 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. 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. St001233The number of indecomposable 2-dimensional modules with projective dimension one. 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. St001489The maximum of the number of descents and the number of inverse descents. St001497The position of the largest weak excedence of a permutation. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001590The crossing number of a perfect matching. St001907The number of Bastidas - Hohlweg - Saliola excedances of a signed permutation. St000024The number of double up and double down steps of a Dyck path. St000039The number of crossings of a permutation. St000144The pyramid weight of the Dyck path. St000166The depth minus 1 of an ordered tree. St000242The number of indices that are not cyclical small weak excedances. St000286The number of connected components of the complement of a graph. St000299The number of nonisomorphic vertex-induced subtrees. St000317The cycle descent number of a permutation. St000325The width of the tree associated to a permutation. St000335The difference of lower and upper interactions. St000358The number of occurrences of the pattern 31-2. St000436The number of occurrences of the pattern 231 or of the pattern 321 in a permutation. St000442The maximal area to the right of an up step of a Dyck path. St000470The number of runs in a permutation. St000710The number of big deficiencies of a permutation. St000720The size of the largest partition in the oscillating tableau corresponding to the perfect matching. St000732The number of double deficiencies of a permutation. St000838The number of terminal right-hand endpoints when the vertices are written in order. St000982The length of the longest constant subword. St000989The number of final rises of a permutation. 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. 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. 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. 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. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. 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. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001390The number of bumps occurring when Schensted-inserting the letter 1 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. St001434The number of negative sum pairs of a signed permutation. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001727The number of invisible inversions of a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St000094The depth of an ordered tree. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001948The number of augmented double ascents of a permutation. St001668The number of points of the poset minus the width of the poset. St001861The number of Bruhat lower covers of a permutation. St001896The number of right descents of a signed permutations. St000898The number of maximal entries in the last diagonal of the monotone triangle. St001855The number of signed permutations less than or equal to a signed permutation in left weak order. St001889The size of the connectivity set of a signed permutation. St000327The number of cover relations in a poset. St001769The reflection length of a signed permutation. St001864The number of excedances of a signed permutation. St001892The flag excedance statistic of a signed permutation. St001894The depth of a signed permutation. St000383The last part of an integer composition. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000466The Gutman (or modified Schultz) index of a connected graph. St001613The binary logarithm of the size of the center of a lattice. St001617The dimension of the space of valuations of a lattice. St001651The Frankl number of a lattice. St000392The length of the longest run of ones in a binary word. St001592The maximal number of simple paths between any two different vertices of a graph. St001863The number of weak excedances of a signed permutation. St001771The number of occurrences of the signed pattern 1-2 in a signed permutation. St001866The nesting alignments of a signed permutation. St001870The number of positive entries followed by a negative entry in a signed permutation. St000464The Schultz index of a connected graph. St001545The second Elser number of a connected graph. St000456The monochromatic index of a connected graph. St000455The second largest eigenvalue of a graph if it is integral.
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!