searching the database
Your data matches 191 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: St001964
(load all 10 compositions to match this statistic)
(load all 10 compositions to match this statistic)
Values
[1] => ([],1)
=> ([],1)
=> 0
[1,1] => ([(0,1)],2)
=> ([],2)
=> 0
[2] => ([],2)
=> ([],1)
=> 0
[1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
[1,2] => ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
[2,1] => ([(0,2),(1,2)],3)
=> ([],2)
=> 0
[3] => ([],3)
=> ([],1)
=> 0
[1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
[1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
[1,3] => ([(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 0
[2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],3)
=> 0
[2,2] => ([(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 0
[3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([],2)
=> 0
[4] => ([],4)
=> ([],1)
=> 0
[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)
=> 0
[1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
[1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
[1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(3,4)],5)
=> 1
[1,4] => ([(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 0
[2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],4)
=> 0
[2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
[2,3] => ([(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 0
[3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],3)
=> 0
[3,2] => ([(1,4),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 0
[4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],2)
=> 0
[5] => ([],5)
=> ([],1)
=> 0
[1,1,1,1,1,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)
=> ([],6)
=> 0
[1,1,1,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
[1,1,4] => ([(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
[1,2,3] => ([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(3,4)],5)
=> 1
[1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(3,4)],5)
=> 1
[1,5] => ([(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 0
[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)
=> 0
[2,1,1,2] => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
[2,1,3] => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
[2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(3,4)],5)
=> 1
[2,4] => ([(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 0
[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)
=> 0
[3,1,2] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
[3,3] => ([(2,5),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 0
[4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],3)
=> 0
[4,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 0
[5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 0
[6] => ([],6)
=> ([],1)
=> 0
[1,1,1,4] => ([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
[1,1,5] => ([(4,5),(4,6),(5,6)],7)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
[1,2,4] => ([(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,4),(1,3),(2,3),(3,4)],5)
=> 1
[1,3,3] => ([(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,4),(1,3),(2,3),(3,4)],5)
=> 1
[1,4,2] => ([(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,4),(1,3),(2,3),(3,4)],5)
=> 1
[1,6] => ([(5,6)],7)
=> ([(0,2),(1,2)],3)
=> 0
Description
The interval resolution global dimension of a poset.
This is the cardinality of the longest chain of right minimal approximations by interval modules of an indecomposable module over the incidence algebra.
Matching statistic: St000052
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00142: Dyck paths —promotion⟶ Dyck paths
Mp00142: Dyck paths —promotion⟶ Dyck paths
St000052: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00142: Dyck paths —promotion⟶ Dyck paths
Mp00142: Dyck paths —promotion⟶ Dyck paths
St000052: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> [1,0]
=> [1,0]
=> 0
[1,1] => [1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
[2] => [1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
[1,1,1] => [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
[1,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[2,1] => [1,1,0,0,1,0]
=> [1,1,1,0,0,0]
=> [1,0,1,1,0,0]
=> 0
[3] => [1,1,1,0,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 0
[2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 0
[2,2] => [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 0
[4] => [1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,0,0]
=> 0
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 2
[1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1
[1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1
[1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 0
[2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1
[2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0
[3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 0
[3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0
[5] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0
[1,1,1,1,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]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> 2
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,1,0,0]
=> 1
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,1,1,0,0,0,0,1,0]
=> 1
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> 1
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 0
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> 0
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> 2
[2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> 1
[2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> 1
[2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> 0
[3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> 0
[3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> 1
[3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 0
[4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0]
=> 0
[4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 0
[5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 0
[6] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 0
[1,1,1,4] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0,1,1,0,0]
=> 2
[1,1,5] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0,1,1,1,0,0,0]
=> 1
[1,2,4] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0,1,1,0,0]
=> 1
[1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0,1,0]
=> 1
[1,4,2] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,0,1,1,1,1,0,0,0,0,0,0]
=> 1
[1,6] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,0,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> 0
Description
The number of valleys of a Dyck path not on the x-axis.
That is, the number of valleys of nonminimal height. This corresponds to the number of -1's in an inclusion of Dyck paths into alternating sign matrices.
Matching statistic: St000687
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00142: Dyck paths —promotion⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St000687: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00142: Dyck paths —promotion⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St000687: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> [1,0]
=> [1,0]
=> 0
[1,1] => [1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
[2] => [1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
[1,1,1] => [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 0
[1,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 0
[2,1] => [1,1,0,0,1,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 0
[3] => [1,1,1,0,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 0
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 0
[1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
[1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 0
[2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 0
[2,2] => [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 0
[3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
[4] => [1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 0
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1
[1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1
[1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 0
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 0
[2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 1
[2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 0
[3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 0
[3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 0
[4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[5] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
[1,1,1,1,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]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> 1
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0]
=> 1
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,0]
=> 1
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> 0
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0]
=> 0
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> 2
[2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> 1
[2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0]
=> 1
[2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> 0
[3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> 0
[3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0]
=> 1
[3,3] => [1,1,1,0,0,0,1,1,1,0,0,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]
=> 0
[4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> 0
[4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> 0
[5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[6] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 0
[1,1,1,4] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,5] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,1,0,0]
=> 1
[1,2,4] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,1,0,0]
=> 1
[1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,1,0,0]
=> 1
[1,4,2] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> 1
[1,6] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,0,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0,1,0]
=> 0
Description
The dimension of $Hom(I,P)$ for the LNakayama algebra of a Dyck path.
In this expression, $I$ is the direct sum of all injective non-projective indecomposable modules and $P$ is the direct sum of all projective non-injective indecomposable modules.
This statistic was discussed in [Theorem 5.7, 1].
Matching statistic: St001331
Mp00039: Integer compositions —complement⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00250: Graphs —clique graph⟶ Graphs
St001331: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00250: Graphs —clique graph⟶ Graphs
St001331: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => ([],1)
=> ([],1)
=> 0
[1,1] => [2] => ([],2)
=> ([],2)
=> 0
[2] => [1,1] => ([(0,1)],2)
=> ([],1)
=> 0
[1,1,1] => [3] => ([],3)
=> ([],3)
=> 0
[1,2] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 0
[2,1] => [1,2] => ([(1,2)],3)
=> ([],2)
=> 0
[3] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> 0
[1,1,1,1] => [4] => ([],4)
=> ([],4)
=> 0
[1,1,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,3] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 0
[2,1,1] => [1,3] => ([(2,3)],4)
=> ([],3)
=> 0
[2,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 0
[3,1] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> 0
[4] => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 0
[1,1,1,1,1] => [5] => ([],5)
=> ([],5)
=> 0
[1,1,1,2] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,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)
=> 1
[1,2,2] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,4] => [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)],2)
=> 0
[2,1,1,1] => [1,4] => ([(3,4)],5)
=> ([],4)
=> 0
[2,1,2] => [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[2,3] => [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 0
[3,1,1] => [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> 0
[3,2] => [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 0
[4,1] => [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> 0
[5] => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,1,1,1,1,1] => [6] => ([],6)
=> ([],6)
=> 0
[1,1,1,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),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,4] => [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),(1,2)],3)
=> 1
[1,2,3] => [2,2,1,1] => ([(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),(1,2)],3)
=> 1
[1,3,2] => [2,1,2,1] => ([(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),(1,2)],3)
=> 1
[1,5] => [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)],2)
=> 0
[2,1,1,1,1] => [1,5] => ([(4,5)],6)
=> ([],5)
=> 0
[2,1,1,2] => [1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[2,1,3] => [1,3,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[2,2,2] => [1,2,2,1] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[2,4] => [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,1)],2)
=> 0
[3,1,1,1] => [1,1,4] => ([(3,4),(3,5),(4,5)],6)
=> ([],4)
=> 0
[3,1,2] => [1,1,3,1] => ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[3,3] => [1,1,2,1,1] => ([(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)],2)
=> 0
[4,1,1] => [1,1,1,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],3)
=> 0
[4,2] => [1,1,1,2,1] => ([(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)],2)
=> 0
[5,1] => [1,1,1,1,2] => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],2)
=> 0
[6] => [1,1,1,1,1,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)
=> ([],1)
=> 0
[1,1,1,4] => [4,1,1,1] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(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),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,5] => [3,1,1,1,1] => ([(0,3),(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,1),(0,2),(1,2)],3)
=> 1
[1,2,4] => [2,2,1,1,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,1),(0,2),(1,2)],3)
=> 1
[1,3,3] => [2,1,2,1,1] => ([(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,1),(0,2),(1,2)],3)
=> 1
[1,4,2] => [2,1,1,2,1] => ([(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,1),(0,2),(1,2)],3)
=> 1
[1,6] => [2,1,1,1,1,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)],2)
=> 0
Description
The size of the minimal feedback vertex set.
A feedback vertex set is a set of vertices whose removal results in an acyclic graph.
Matching statistic: St001336
Mp00039: Integer compositions —complement⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00250: Graphs —clique graph⟶ Graphs
St001336: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00250: Graphs —clique graph⟶ Graphs
St001336: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => ([],1)
=> ([],1)
=> 0
[1,1] => [2] => ([],2)
=> ([],2)
=> 0
[2] => [1,1] => ([(0,1)],2)
=> ([],1)
=> 0
[1,1,1] => [3] => ([],3)
=> ([],3)
=> 0
[1,2] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 0
[2,1] => [1,2] => ([(1,2)],3)
=> ([],2)
=> 0
[3] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> 0
[1,1,1,1] => [4] => ([],4)
=> ([],4)
=> 0
[1,1,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,3] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 0
[2,1,1] => [1,3] => ([(2,3)],4)
=> ([],3)
=> 0
[2,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 0
[3,1] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> 0
[4] => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 0
[1,1,1,1,1] => [5] => ([],5)
=> ([],5)
=> 0
[1,1,1,2] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,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)
=> 1
[1,2,2] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,4] => [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)],2)
=> 0
[2,1,1,1] => [1,4] => ([(3,4)],5)
=> ([],4)
=> 0
[2,1,2] => [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[2,3] => [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 0
[3,1,1] => [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> 0
[3,2] => [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 0
[4,1] => [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> 0
[5] => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,1,1,1,1,1] => [6] => ([],6)
=> ([],6)
=> 0
[1,1,1,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),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,4] => [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),(1,2)],3)
=> 1
[1,2,3] => [2,2,1,1] => ([(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),(1,2)],3)
=> 1
[1,3,2] => [2,1,2,1] => ([(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),(1,2)],3)
=> 1
[1,5] => [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)],2)
=> 0
[2,1,1,1,1] => [1,5] => ([(4,5)],6)
=> ([],5)
=> 0
[2,1,1,2] => [1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[2,1,3] => [1,3,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[2,2,2] => [1,2,2,1] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[2,4] => [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,1)],2)
=> 0
[3,1,1,1] => [1,1,4] => ([(3,4),(3,5),(4,5)],6)
=> ([],4)
=> 0
[3,1,2] => [1,1,3,1] => ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[3,3] => [1,1,2,1,1] => ([(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)],2)
=> 0
[4,1,1] => [1,1,1,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],3)
=> 0
[4,2] => [1,1,1,2,1] => ([(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)],2)
=> 0
[5,1] => [1,1,1,1,2] => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],2)
=> 0
[6] => [1,1,1,1,1,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)
=> ([],1)
=> 0
[1,1,1,4] => [4,1,1,1] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(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),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,5] => [3,1,1,1,1] => ([(0,3),(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,1),(0,2),(1,2)],3)
=> 1
[1,2,4] => [2,2,1,1,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,1),(0,2),(1,2)],3)
=> 1
[1,3,3] => [2,1,2,1,1] => ([(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,1),(0,2),(1,2)],3)
=> 1
[1,4,2] => [2,1,1,2,1] => ([(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,1),(0,2),(1,2)],3)
=> 1
[1,6] => [2,1,1,1,1,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)],2)
=> 0
Description
The minimal number of vertices in a graph whose complement is triangle-free.
Matching statistic: St001572
Mp00039: Integer compositions —complement⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00250: Graphs —clique graph⟶ Graphs
St001572: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00250: Graphs —clique graph⟶ Graphs
St001572: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => ([],1)
=> ([],1)
=> 0
[1,1] => [2] => ([],2)
=> ([],2)
=> 0
[2] => [1,1] => ([(0,1)],2)
=> ([],1)
=> 0
[1,1,1] => [3] => ([],3)
=> ([],3)
=> 0
[1,2] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 0
[2,1] => [1,2] => ([(1,2)],3)
=> ([],2)
=> 0
[3] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> 0
[1,1,1,1] => [4] => ([],4)
=> ([],4)
=> 0
[1,1,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,3] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 0
[2,1,1] => [1,3] => ([(2,3)],4)
=> ([],3)
=> 0
[2,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 0
[3,1] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> 0
[4] => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 0
[1,1,1,1,1] => [5] => ([],5)
=> ([],5)
=> 0
[1,1,1,2] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,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)
=> 1
[1,2,2] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,4] => [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)],2)
=> 0
[2,1,1,1] => [1,4] => ([(3,4)],5)
=> ([],4)
=> 0
[2,1,2] => [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[2,3] => [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 0
[3,1,1] => [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> 0
[3,2] => [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 0
[4,1] => [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> 0
[5] => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,1,1,1,1,1] => [6] => ([],6)
=> ([],6)
=> 0
[1,1,1,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),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,4] => [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),(1,2)],3)
=> 1
[1,2,3] => [2,2,1,1] => ([(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),(1,2)],3)
=> 1
[1,3,2] => [2,1,2,1] => ([(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),(1,2)],3)
=> 1
[1,5] => [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)],2)
=> 0
[2,1,1,1,1] => [1,5] => ([(4,5)],6)
=> ([],5)
=> 0
[2,1,1,2] => [1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[2,1,3] => [1,3,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[2,2,2] => [1,2,2,1] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[2,4] => [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,1)],2)
=> 0
[3,1,1,1] => [1,1,4] => ([(3,4),(3,5),(4,5)],6)
=> ([],4)
=> 0
[3,1,2] => [1,1,3,1] => ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[3,3] => [1,1,2,1,1] => ([(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)],2)
=> 0
[4,1,1] => [1,1,1,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],3)
=> 0
[4,2] => [1,1,1,2,1] => ([(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)],2)
=> 0
[5,1] => [1,1,1,1,2] => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],2)
=> 0
[6] => [1,1,1,1,1,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)
=> ([],1)
=> 0
[1,1,1,4] => [4,1,1,1] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(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),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,5] => [3,1,1,1,1] => ([(0,3),(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,1),(0,2),(1,2)],3)
=> 1
[1,2,4] => [2,2,1,1,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,1),(0,2),(1,2)],3)
=> 1
[1,3,3] => [2,1,2,1,1] => ([(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,1),(0,2),(1,2)],3)
=> 1
[1,4,2] => [2,1,1,2,1] => ([(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,1),(0,2),(1,2)],3)
=> 1
[1,6] => [2,1,1,1,1,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)],2)
=> 0
Description
The minimal number of edges to remove to make a graph bipartite.
Matching statistic: St001573
Mp00039: Integer compositions —complement⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00250: Graphs —clique graph⟶ Graphs
St001573: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00250: Graphs —clique graph⟶ Graphs
St001573: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => ([],1)
=> ([],1)
=> 0
[1,1] => [2] => ([],2)
=> ([],2)
=> 0
[2] => [1,1] => ([(0,1)],2)
=> ([],1)
=> 0
[1,1,1] => [3] => ([],3)
=> ([],3)
=> 0
[1,2] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 0
[2,1] => [1,2] => ([(1,2)],3)
=> ([],2)
=> 0
[3] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> 0
[1,1,1,1] => [4] => ([],4)
=> ([],4)
=> 0
[1,1,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,3] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 0
[2,1,1] => [1,3] => ([(2,3)],4)
=> ([],3)
=> 0
[2,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 0
[3,1] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> 0
[4] => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 0
[1,1,1,1,1] => [5] => ([],5)
=> ([],5)
=> 0
[1,1,1,2] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,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)
=> 1
[1,2,2] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,4] => [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)],2)
=> 0
[2,1,1,1] => [1,4] => ([(3,4)],5)
=> ([],4)
=> 0
[2,1,2] => [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[2,3] => [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 0
[3,1,1] => [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> 0
[3,2] => [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 0
[4,1] => [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> 0
[5] => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,1,1,1,1,1] => [6] => ([],6)
=> ([],6)
=> 0
[1,1,1,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),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,4] => [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),(1,2)],3)
=> 1
[1,2,3] => [2,2,1,1] => ([(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),(1,2)],3)
=> 1
[1,3,2] => [2,1,2,1] => ([(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),(1,2)],3)
=> 1
[1,5] => [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)],2)
=> 0
[2,1,1,1,1] => [1,5] => ([(4,5)],6)
=> ([],5)
=> 0
[2,1,1,2] => [1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[2,1,3] => [1,3,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[2,2,2] => [1,2,2,1] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[2,4] => [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,1)],2)
=> 0
[3,1,1,1] => [1,1,4] => ([(3,4),(3,5),(4,5)],6)
=> ([],4)
=> 0
[3,1,2] => [1,1,3,1] => ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[3,3] => [1,1,2,1,1] => ([(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)],2)
=> 0
[4,1,1] => [1,1,1,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],3)
=> 0
[4,2] => [1,1,1,2,1] => ([(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)],2)
=> 0
[5,1] => [1,1,1,1,2] => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],2)
=> 0
[6] => [1,1,1,1,1,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)
=> ([],1)
=> 0
[1,1,1,4] => [4,1,1,1] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(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),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,5] => [3,1,1,1,1] => ([(0,3),(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,1),(0,2),(1,2)],3)
=> 1
[1,2,4] => [2,2,1,1,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,1),(0,2),(1,2)],3)
=> 1
[1,3,3] => [2,1,2,1,1] => ([(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,1),(0,2),(1,2)],3)
=> 1
[1,4,2] => [2,1,1,2,1] => ([(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,1),(0,2),(1,2)],3)
=> 1
[1,6] => [2,1,1,1,1,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)],2)
=> 0
Description
The minimal number of edges to remove to make a graph triangle-free.
Matching statistic: St001578
Values
[1] => ([],1)
=> ([],1)
=> ([],1)
=> 0
[1,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> ([],2)
=> 0
[2] => ([],2)
=> ([],1)
=> ([],1)
=> 0
[1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
[1,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
[2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> ([],2)
=> 0
[3] => ([],3)
=> ([],1)
=> ([],1)
=> 0
[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)
=> 0
[1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
[1,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
[2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
[2,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
[3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> ([],2)
=> 0
[4] => ([],4)
=> ([],1)
=> ([],1)
=> 0
[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)
=> 0
[1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
[1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
[1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
[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)
=> 0
[2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
[2,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
[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)
=> 0
[3,2] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
[4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> ([],2)
=> 0
[5] => ([],5)
=> ([],1)
=> ([],1)
=> 0
[1,1,1,1,1,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)
=> 0
[1,1,1,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
[1,1,4] => ([(3,4),(3,5),(4,5)],6)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
[1,2,3] => ([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,5] => ([(4,5)],6)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
[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)
=> 0
[2,1,1,2] => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
[2,1,3] => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
[2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[2,4] => ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
[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)
=> 0
[3,1,2] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
[3,3] => ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
[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)
=> 0
[4,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
[5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1)],2)
=> ([],2)
=> 0
[6] => ([],6)
=> ([],1)
=> ([],1)
=> 0
[1,1,1,4] => ([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
[1,1,5] => ([(4,5),(4,6),(5,6)],7)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
[1,2,4] => ([(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,3,3] => ([(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,4,2] => ([(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,6] => ([(5,6)],7)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
Description
The minimal number of edges to add or remove to make a graph a line graph.
Matching statistic: St001638
Mp00039: Integer compositions —complement⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00250: Graphs —clique graph⟶ Graphs
St001638: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00250: Graphs —clique graph⟶ Graphs
St001638: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => ([],1)
=> ([],1)
=> 0
[1,1] => [2] => ([],2)
=> ([],2)
=> 0
[2] => [1,1] => ([(0,1)],2)
=> ([],1)
=> 0
[1,1,1] => [3] => ([],3)
=> ([],3)
=> 0
[1,2] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 0
[2,1] => [1,2] => ([(1,2)],3)
=> ([],2)
=> 0
[3] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> 0
[1,1,1,1] => [4] => ([],4)
=> ([],4)
=> 0
[1,1,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,3] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 0
[2,1,1] => [1,3] => ([(2,3)],4)
=> ([],3)
=> 0
[2,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 0
[3,1] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> 0
[4] => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 0
[1,1,1,1,1] => [5] => ([],5)
=> ([],5)
=> 0
[1,1,1,2] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,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)
=> 1
[1,2,2] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,4] => [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)],2)
=> 0
[2,1,1,1] => [1,4] => ([(3,4)],5)
=> ([],4)
=> 0
[2,1,2] => [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[2,3] => [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 0
[3,1,1] => [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> 0
[3,2] => [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 0
[4,1] => [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> 0
[5] => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,1,1,1,1,1] => [6] => ([],6)
=> ([],6)
=> 0
[1,1,1,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),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,4] => [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),(1,2)],3)
=> 1
[1,2,3] => [2,2,1,1] => ([(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),(1,2)],3)
=> 1
[1,3,2] => [2,1,2,1] => ([(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),(1,2)],3)
=> 1
[1,5] => [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)],2)
=> 0
[2,1,1,1,1] => [1,5] => ([(4,5)],6)
=> ([],5)
=> 0
[2,1,1,2] => [1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[2,1,3] => [1,3,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[2,2,2] => [1,2,2,1] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[2,4] => [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,1)],2)
=> 0
[3,1,1,1] => [1,1,4] => ([(3,4),(3,5),(4,5)],6)
=> ([],4)
=> 0
[3,1,2] => [1,1,3,1] => ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[3,3] => [1,1,2,1,1] => ([(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)],2)
=> 0
[4,1,1] => [1,1,1,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],3)
=> 0
[4,2] => [1,1,1,2,1] => ([(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)],2)
=> 0
[5,1] => [1,1,1,1,2] => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],2)
=> 0
[6] => [1,1,1,1,1,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)
=> ([],1)
=> 0
[1,1,1,4] => [4,1,1,1] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(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),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,5] => [3,1,1,1,1] => ([(0,3),(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,1),(0,2),(1,2)],3)
=> 1
[1,2,4] => [2,2,1,1,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,1),(0,2),(1,2)],3)
=> 1
[1,3,3] => [2,1,2,1,1] => ([(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,1),(0,2),(1,2)],3)
=> 1
[1,4,2] => [2,1,1,2,1] => ([(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,1),(0,2),(1,2)],3)
=> 1
[1,6] => [2,1,1,1,1,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)],2)
=> 0
Description
The book thickness of a graph.
The book thickness (or pagenumber, or stacknumber) of a graph is the minimal number of pages required for a book embedding of a graph.
Matching statistic: St001723
Mp00039: Integer compositions —complement⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00250: Graphs —clique graph⟶ Graphs
St001723: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00250: Graphs —clique graph⟶ Graphs
St001723: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => ([],1)
=> ([],1)
=> 0
[1,1] => [2] => ([],2)
=> ([],2)
=> 0
[2] => [1,1] => ([(0,1)],2)
=> ([],1)
=> 0
[1,1,1] => [3] => ([],3)
=> ([],3)
=> 0
[1,2] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 0
[2,1] => [1,2] => ([(1,2)],3)
=> ([],2)
=> 0
[3] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> 0
[1,1,1,1] => [4] => ([],4)
=> ([],4)
=> 0
[1,1,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,3] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 0
[2,1,1] => [1,3] => ([(2,3)],4)
=> ([],3)
=> 0
[2,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 0
[3,1] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> 0
[4] => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 0
[1,1,1,1,1] => [5] => ([],5)
=> ([],5)
=> 0
[1,1,1,2] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,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)
=> 1
[1,2,2] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,4] => [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)],2)
=> 0
[2,1,1,1] => [1,4] => ([(3,4)],5)
=> ([],4)
=> 0
[2,1,2] => [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[2,3] => [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 0
[3,1,1] => [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> 0
[3,2] => [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 0
[4,1] => [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> 0
[5] => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,1,1,1,1,1] => [6] => ([],6)
=> ([],6)
=> 0
[1,1,1,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),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,4] => [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),(1,2)],3)
=> 1
[1,2,3] => [2,2,1,1] => ([(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),(1,2)],3)
=> 1
[1,3,2] => [2,1,2,1] => ([(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),(1,2)],3)
=> 1
[1,5] => [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)],2)
=> 0
[2,1,1,1,1] => [1,5] => ([(4,5)],6)
=> ([],5)
=> 0
[2,1,1,2] => [1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[2,1,3] => [1,3,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[2,2,2] => [1,2,2,1] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[2,4] => [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,1)],2)
=> 0
[3,1,1,1] => [1,1,4] => ([(3,4),(3,5),(4,5)],6)
=> ([],4)
=> 0
[3,1,2] => [1,1,3,1] => ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[3,3] => [1,1,2,1,1] => ([(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)],2)
=> 0
[4,1,1] => [1,1,1,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],3)
=> 0
[4,2] => [1,1,1,2,1] => ([(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)],2)
=> 0
[5,1] => [1,1,1,1,2] => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],2)
=> 0
[6] => [1,1,1,1,1,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)
=> ([],1)
=> 0
[1,1,1,4] => [4,1,1,1] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(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),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,5] => [3,1,1,1,1] => ([(0,3),(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,1),(0,2),(1,2)],3)
=> 1
[1,2,4] => [2,2,1,1,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,1),(0,2),(1,2)],3)
=> 1
[1,3,3] => [2,1,2,1,1] => ([(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,1),(0,2),(1,2)],3)
=> 1
[1,4,2] => [2,1,1,2,1] => ([(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,1),(0,2),(1,2)],3)
=> 1
[1,6] => [2,1,1,1,1,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)],2)
=> 0
Description
The differential of a graph.
The external neighbourhood (or boundary) of a set of vertices $S\subseteq V(G)$ is the set of vertices not in $S$ which are adjacent to a vertex in $S$.
The differential of a set of vertices $S\subseteq V(G)$ is the difference of the size of the external neighbourhood of $S$ and the size of $S$.
The differential of a graph is the maximal differential of a set of vertices.
The following 181 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001724The 2-packing differential of a graph. St000346The number of coarsenings of a partition. St001740The number of graphs with the same symmetric edge polytope as the given graph. St000590The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, 1 is maximal, (2,3) are consecutive in a block. St000606The number of occurrences of the pattern {{1},{2,3}} such that 1,3 are maximal, (2,3) are consecutive in a block. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St000407The number of occurrences of the pattern 2143 in a permutation. St000751The number of occurrences of either of the pattern 2143 or 2143 in a permutation. St000001The number of reduced words for a permutation. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St000881The number of short braid edges in the graph of braid moves of a permutation. St000880The number of connected components of long braid edges in the graph of braid moves of a permutation. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001323The independence gap of a graph. St000668The least common multiple of the parts of the partition. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St000454The largest eigenvalue of a graph if it is integral. St000732The number of double deficiencies of a permutation. St001715The number of non-records in a permutation. St001846The number of elements which do not have a complement in the lattice. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001820The size of the image of the pop stack sorting operator. St000516The number of stretching pairs of a permutation. St001856The number of edges in the reduced word graph of a permutation. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St000699The toughness times the least common multiple of 1,. St000068The number of minimal elements in a poset. St000260The radius of a connected graph. St000456The monochromatic index of a connected graph. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St000022The number of fixed points of a permutation. St000534The number of 2-rises of a permutation. St000731The number of double exceedences of a permutation. St000451The length of the longest pattern of the form k 1 2. St000842The breadth of a permutation. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St000404The number of occurrences of the pattern 3241 or of the pattern 4231 in a permutation. St000408The number of occurrences of the pattern 4231 in a permutation. St000440The number of occurrences of the pattern 4132 or of the pattern 4231 in a permutation. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St000264The girth of a graph, which is not a tree. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001301The first Betti number of the order complex associated with the poset. St001396Number of triples of incomparable elements in a finite poset. St000908The length of the shortest maximal antichain in a poset. St000914The sum of the values of the Möbius function of a poset. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St001722The number of minimal chains with small intervals between a binary word and the top element. St000039The number of crossings of a permutation. St000217The number of occurrences of the pattern 312 in a permutation. St000221The number of strong fixed points of a permutation. St000234The number of global ascents of a permutation. St000247The number of singleton blocks of a set partition. St000279The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations. St000295The length of the border of a binary word. St000317The cycle descent number of a permutation. St000338The number of pixed points of a permutation. St000355The number of occurrences of the pattern 21-3. St000358The number of occurrences of the pattern 31-2. St000360The number of occurrences of the pattern 32-1. St000365The number of double ascents of a permutation. St000367The number of simsun double descents of a permutation. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St000406The number of occurrences of the pattern 3241 in a permutation. St000432The number of occurrences of the pattern 231 or of the pattern 312 in a permutation. St000462The major index minus the number of excedences of a permutation. St000486The number of cycles of length at least 3 of a permutation. St000500Eigenvalues of the random-to-random operator acting on the regular representation. St000559The number of occurrences of the pattern {{1,3},{2,4}} in a set partition. St000561The number of occurrences of the pattern {{1,2,3}} in a set partition. St000563The number of overlapping pairs of blocks of a set partition. St000573The number of occurrences of the pattern {{1},{2}} such that 1 is a singleton and 2 a maximal element. St000575The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal element and 2 a singleton. St000578The number of occurrences of the pattern {{1},{2}} such that 1 is a singleton. St000622The number of occurrences of the patterns 2143 or 4231 in a permutation. St000623The number of occurrences of the pattern 52341 in a permutation. St000664The number of right ropes of a permutation. St000666The number of right tethers of a permutation. St000750The number of occurrences of the pattern 4213 in a permutation. St000779The tier of a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000872The number of very big descents of a permutation. St000961The shifted major index of a permutation. St000962The 3-shifted major index of a permutation. St000963The 2-shifted major index of a permutation. St000989The number of final rises of a permutation. St001059Number of occurrences of the patterns 41352,42351,51342,52341 in a permutation. St001082The number of boxed occurrences of 123 in a permutation. St001130The number of two successive successions in a permutation. St001174The Gorenstein dimension of the algebra $A/I$ when $I$ is the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001332The number of steps on the non-negative side of the walk associated with the permutation. St001371The length of the longest Yamanouchi prefix of a binary word. St001381The fertility of a permutation. St001402The number of separators in a permutation. St001403The number of vertical separators in a permutation. St001513The number of nested exceedences of a permutation. St001537The number of cyclic crossings of a permutation. St001549The number of restricted non-inversions between exceedances. St001550The number of inversions between exceedances where the greater exceedance is linked. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001552The number of inversions between excedances and fixed points of a permutation. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St001705The number of occurrences of the pattern 2413 in a permutation. St001728The number of invisible descents of a permutation. St001730The number of times the path corresponding to a binary word crosses the base line. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001771The number of occurrences of the signed pattern 1-2 in a signed permutation. St001781The interlacing number of a set partition. St001810The number of fixed points of a permutation smaller than its largest moved point. St001847The number of occurrences of the pattern 1432 in a permutation. St001857The number of edges in the reduced word graph of a signed permutation. St001866The nesting alignments of a signed permutation. St001870The number of positive entries followed by a negative entry in a signed permutation. St001895The oddness of a signed permutation. St000021The number of descents of a permutation. St000056The decomposition (or block) number of a permutation. St000154The sum of the descent bottoms of a permutation. St000210Minimum over maximum difference of elements in cycles. St000253The crossing number of a set partition. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000570The Edelman-Greene number of a permutation. St000654The first descent of a permutation. St000694The number of affine bounded permutations that project to a given permutation. St000729The minimal arc length of a set partition. St000864The number of circled entries of the shifted recording tableau of a permutation. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St000886The number of permutations with the same antidiagonal sums. St001162The minimum jump of a permutation. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001208The number of connected components of the quiver of $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra $A$ of $K[x]/(x^n)$. St001344The neighbouring number of a permutation. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001461The number of topologically connected components of the chord diagram of a permutation. St001462The number of factors of a standard tableaux under concatenation. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St001665The number of pure excedances of a permutation. St001729The number of visible descents of a permutation. St001737The number of descents of type 2 in a permutation. St001806The upper middle entry of a permutation. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001884The number of borders of a binary word. St001889The size of the connectivity set of a signed permutation. St001928The number of non-overlapping descents in a permutation. St000084The number of subtrees. St000325The width of the tree associated to a permutation. St000328The maximum number of child nodes in a tree. St000470The number of runs in a permutation. St000485The length of the longest cycle of a permutation. St000487The length of the shortest cycle of a permutation. St000504The cardinality of the first block of a set partition. St000542The number of left-to-right-minima of a permutation. St001062The maximal size of a block of a set partition. St001075The minimal size of a block of a set partition. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St000219The number of occurrences of the pattern 231 in a permutation. St000259The diameter of a connected graph. St000302The determinant of the distance matrix of a connected graph. St000466The Gutman (or modified Schultz) index of a connected graph. St000467The hyper-Wiener index of a connected graph. St000879The number of long braid edges in the graph of braid moves of a permutation. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001645The pebbling number of a connected graph. St001805The maximal overlap of a cylindrical tableau associated with a semistandard tableau.
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!