searching the database
Your data matches 183 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: St000273
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
[1,1] => ([(0,1)],2)
=> ([],1)
=> ([],1)
=> 1
[1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2] => ([(1,2)],3)
=> ([],1)
=> ([],1)
=> 1
[2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2
[1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3] => ([(2,3)],4)
=> ([],1)
=> ([],1)
=> 1
[2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[2,2] => ([(1,3),(2,3)],4)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2
[1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> 3
[1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,4] => ([(3,4)],5)
=> ([],1)
=> ([],1)
=> 1
[2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[2,3] => ([(2,4),(3,4)],5)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[3,2] => ([(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,1,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2
[1,1,2,2] => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> 3
[1,1,4] => ([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,3] => ([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(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,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
[1,5] => ([(4,5)],6)
=> ([],1)
=> ([],1)
=> 1
[2,1,3] => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,5),(0,6),(1,4),(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,5),(0,6),(1,4),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[2,4] => ([(3,5),(4,5)],6)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[3,3] => ([(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[4,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[5,1] => ([(0,5),(1,5),(2,5),(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,1,4] => ([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2
[1,1,2,3] => ([(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> 3
[1,1,5] => ([(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,4] => ([(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3,3] => ([(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,4,2] => ([(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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,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
[1,6] => ([(5,6)],7)
=> ([],1)
=> ([],1)
=> 1
[2,1,4] => ([(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[2,2,3] => ([(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[2,3,2] => ([(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,5),(0,6),(1,4),(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,5),(0,6),(1,4),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[2,5] => ([(4,6),(5,6)],7)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[3,4] => ([(3,6),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[4,3] => ([(2,6),(3,6),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[5,2] => ([(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
Description
The domination number of a graph.
The domination number of a graph is given by the minimum size of a dominating set of vertices. A dominating set of vertices is a subset of the vertex set of such that every vertex is either in this subset or adjacent to an element of this subset.
Matching statistic: St001322
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
[1,1] => ([(0,1)],2)
=> ([],1)
=> ([],1)
=> 1
[1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2] => ([(1,2)],3)
=> ([],1)
=> ([],1)
=> 1
[2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2
[1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3] => ([(2,3)],4)
=> ([],1)
=> ([],1)
=> 1
[2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[2,2] => ([(1,3),(2,3)],4)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2
[1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> 3
[1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,4] => ([(3,4)],5)
=> ([],1)
=> ([],1)
=> 1
[2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[2,3] => ([(2,4),(3,4)],5)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[3,2] => ([(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,1,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2
[1,1,2,2] => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> 3
[1,1,4] => ([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,3] => ([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(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,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
[1,5] => ([(4,5)],6)
=> ([],1)
=> ([],1)
=> 1
[2,1,3] => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,5),(0,6),(1,4),(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,5),(0,6),(1,4),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[2,4] => ([(3,5),(4,5)],6)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[3,3] => ([(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[4,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[5,1] => ([(0,5),(1,5),(2,5),(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,1,4] => ([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2
[1,1,2,3] => ([(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> 3
[1,1,5] => ([(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,4] => ([(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3,3] => ([(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,4,2] => ([(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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,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
[1,6] => ([(5,6)],7)
=> ([],1)
=> ([],1)
=> 1
[2,1,4] => ([(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[2,2,3] => ([(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[2,3,2] => ([(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,5),(0,6),(1,4),(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,5),(0,6),(1,4),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[2,5] => ([(4,6),(5,6)],7)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[3,4] => ([(3,6),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[4,3] => ([(2,6),(3,6),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[5,2] => ([(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
Description
The size of a minimal independent dominating set in a graph.
Matching statistic: St001339
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Values
[1,1] => ([(0,1)],2)
=> ([],1)
=> ([],1)
=> 1
[1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2] => ([(1,2)],3)
=> ([],1)
=> ([],1)
=> 1
[2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2
[1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3] => ([(2,3)],4)
=> ([],1)
=> ([],1)
=> 1
[2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[2,2] => ([(1,3),(2,3)],4)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2
[1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> 3
[1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,4] => ([(3,4)],5)
=> ([],1)
=> ([],1)
=> 1
[2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[2,3] => ([(2,4),(3,4)],5)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[3,2] => ([(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,1,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2
[1,1,2,2] => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> 3
[1,1,4] => ([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,3] => ([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(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,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
[1,5] => ([(4,5)],6)
=> ([],1)
=> ([],1)
=> 1
[2,1,3] => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,5),(0,6),(1,4),(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,5),(0,6),(1,4),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[2,4] => ([(3,5),(4,5)],6)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[3,3] => ([(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[4,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[5,1] => ([(0,5),(1,5),(2,5),(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,1,4] => ([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2
[1,1,2,3] => ([(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> 3
[1,1,5] => ([(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,4] => ([(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3,3] => ([(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,4,2] => ([(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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,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
[1,6] => ([(5,6)],7)
=> ([],1)
=> ([],1)
=> 1
[2,1,4] => ([(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[2,2,3] => ([(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[2,3,2] => ([(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,5),(0,6),(1,4),(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,5),(0,6),(1,4),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[2,5] => ([(4,6),(5,6)],7)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[3,4] => ([(3,6),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[4,3] => ([(2,6),(3,6),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[5,2] => ([(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
Description
The irredundance number of a graph.
A set $S$ of vertices is irredundant, if there is no vertex in $S$, whose closed neighbourhood is contained in the union of the closed neighbourhoods of the other vertices of $S$.
The irredundance number is the smallest size of a maximal irredundant set.
Matching statistic: St001829
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
[1,1] => ([(0,1)],2)
=> ([],1)
=> ([],1)
=> 1
[1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2] => ([(1,2)],3)
=> ([],1)
=> ([],1)
=> 1
[2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2
[1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3] => ([(2,3)],4)
=> ([],1)
=> ([],1)
=> 1
[2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[2,2] => ([(1,3),(2,3)],4)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2
[1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> 3
[1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,4] => ([(3,4)],5)
=> ([],1)
=> ([],1)
=> 1
[2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[2,3] => ([(2,4),(3,4)],5)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[3,2] => ([(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,1,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2
[1,1,2,2] => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> 3
[1,1,4] => ([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,3] => ([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(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,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
[1,5] => ([(4,5)],6)
=> ([],1)
=> ([],1)
=> 1
[2,1,3] => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,5),(0,6),(1,4),(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,5),(0,6),(1,4),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[2,4] => ([(3,5),(4,5)],6)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[3,3] => ([(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[4,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[5,1] => ([(0,5),(1,5),(2,5),(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,1,4] => ([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2
[1,1,2,3] => ([(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> 3
[1,1,5] => ([(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,4] => ([(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3,3] => ([(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,4,2] => ([(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(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,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
[1,6] => ([(5,6)],7)
=> ([],1)
=> ([],1)
=> 1
[2,1,4] => ([(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[2,2,3] => ([(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[2,3,2] => ([(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,5),(0,6),(1,4),(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,5),(0,6),(1,4),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[2,5] => ([(4,6),(5,6)],7)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[3,4] => ([(3,6),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[4,3] => ([(2,6),(3,6),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[5,2] => ([(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
Description
The common independence number of a graph.
The common independence number of a graph $G$ is the greatest integer $r$ such that every vertex of $G$ belongs to some independent set $X$ of vertices of cardinality at least $r$.
Matching statistic: St000687
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00132: Dyck paths —switch returns and last double rise⟶ Dyck paths
Mp00122: Dyck paths —Elizalde-Deutsch bijection⟶ Dyck paths
St000687: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00132: Dyck paths —switch returns and last double rise⟶ Dyck paths
Mp00122: Dyck paths —Elizalde-Deutsch bijection⟶ Dyck paths
St000687: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1] => [1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0 = 1 - 1
[1,1,1] => [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
[1,2] => [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
[2,1] => [1,1,0,0,1,0]
=> [1,1,0,0,1,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,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 0 = 1 - 1
[2,2] => [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> 0 = 1 - 1
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 0 = 1 - 1
[2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 0 = 1 - 1
[2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 0 = 1 - 1
[4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 0 = 1 - 1
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> 0 = 1 - 1
[2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> 0 = 1 - 1
[2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> 0 = 1 - 1
[2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> 0 = 1 - 1
[4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> 0 = 1 - 1
[5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> 0 = 1 - 1
[1,1,1,4] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,1,0,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,2,3] => [1,0,1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,5] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,1,0,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,2,4] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,4,2] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,6] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[2,1,4] => [1,1,0,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,1,0,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> 0 = 1 - 1
[2,2,3] => [1,1,0,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,1,0,0]
=> 0 = 1 - 1
[2,3,2] => [1,1,0,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,1,0,0,1,0,0]
=> 0 = 1 - 1
[2,5] => [1,1,0,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[3,4] => [1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> 0 = 1 - 1
[4,3] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,1,0,1,0,0,0]
=> 0 = 1 - 1
[5,2] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,1,0,1,0,0,0]
=> 0 = 1 - 1
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: St001033
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00142: Dyck paths —promotion⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St001033: 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
St001033: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1] => [1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
[1,1,1] => [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
[1,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
[2,1] => [1,1,0,0,1,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[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]
=> 1 = 2 - 1
[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]
=> 0 = 1 - 1
[1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 0 = 1 - 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 = 1 - 1
[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 = 1 - 1
[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 = 1 - 1
[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 = 1 - 1
[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]
=> 1 = 2 - 1
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2 = 3 - 1
[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]
=> 0 = 1 - 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]
=> 0 = 1 - 1
[1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 0 = 1 - 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 = 1 - 1
[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]
=> 0 = 1 - 1
[2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 0 = 1 - 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 = 1 - 1
[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 = 1 - 1
[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 = 1 - 1
[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]
=> 1 = 2 - 1
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,1,0,1,0,0,0]
=> 2 = 3 - 1
[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]
=> 0 = 1 - 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]
=> 0 = 1 - 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]
=> 0 = 1 - 1
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 0 = 1 - 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 = 1 - 1
[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]
=> 0 = 1 - 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]
=> 0 = 1 - 1
[2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> 0 = 1 - 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 = 1 - 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 = 1 - 1
[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 = 1 - 1
[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 = 1 - 1
[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]
=> 1 = 2 - 1
[1,1,2,3] => [1,0,1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,1,0,1,0,0,0]
=> 2 = 3 - 1
[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]
=> 0 = 1 - 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]
=> 0 = 1 - 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]
=> 0 = 1 - 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]
=> 0 = 1 - 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 = 1 - 1
[2,1,4] => [1,1,0,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[2,2,3] => [1,1,0,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[2,3,2] => [1,1,0,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[2,5] => [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]
=> [1,1,0,1,0,1,0,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[3,4] => [1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[4,3] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[5,2] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
Description
The normalized area of the parallelogram polyomino associated with the Dyck path.
The area of the smallest parallelogram polyomino equals the semilength of the Dyck path. This statistic is therefore the area of the parallelogram polyomino minus the semilength of the Dyck path.
The area itself is equidistributed with [[St001034]] and with [[St000395]].
Matching statistic: St001309
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00038: Integer compositions —reverse⟶ Integer compositions
Mp00173: Integer compositions —rotate front to back⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St001309: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00173: Integer compositions —rotate front to back⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St001309: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1] => [1,1] => [1,1] => ([(0,1)],2)
=> 0 = 1 - 1
[1,1,1] => [1,1,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 0 = 1 - 1
[1,2] => [2,1] => [1,2] => ([(1,2)],3)
=> 0 = 1 - 1
[2,1] => [1,2] => [2,1] => ([(0,2),(1,2)],3)
=> 0 = 1 - 1
[1,1,1,1] => [1,1,1,1] => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,1,2] => [2,1,1] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 0 = 1 - 1
[1,2,1] => [1,2,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0 = 1 - 1
[1,3] => [3,1] => [1,3] => ([(2,3)],4)
=> 0 = 1 - 1
[2,1,1] => [1,1,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 0 = 1 - 1
[2,2] => [2,2] => [2,2] => ([(1,3),(2,3)],4)
=> 0 = 1 - 1
[3,1] => [1,3] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 0 = 1 - 1
[1,1,1,2] => [2,1,1,1] => [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,2,1] => [1,2,1,1] => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
[1,1,3] => [3,1,1] => [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,2,2] => [2,2,1] => [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,3,1] => [1,3,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,4] => [4,1] => [1,4] => ([(3,4)],5)
=> 0 = 1 - 1
[2,1,2] => [2,1,2] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[2,2,1] => [1,2,2] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[2,3] => [3,2] => [2,3] => ([(2,4),(3,4)],5)
=> 0 = 1 - 1
[3,2] => [2,3] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
[4,1] => [1,4] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,1,1,3] => [3,1,1,1] => [1,1,1,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1 = 2 - 1
[1,1,2,2] => [2,2,1,1] => [2,1,1,2] => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
[1,1,4] => [4,1,1] => [1,1,4] => ([(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,2,3] => [3,2,1] => [2,1,3] => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,3,2] => [2,3,1] => [3,1,2] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,4,1] => [1,4,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 - 1
[1,5] => [5,1] => [1,5] => ([(4,5)],6)
=> 0 = 1 - 1
[2,1,3] => [3,1,2] => [1,2,3] => ([(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
[2,2,2] => [2,2,2] => [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
[2,3,1] => [1,3,2] => [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
[2,4] => [4,2] => [2,4] => ([(3,5),(4,5)],6)
=> 0 = 1 - 1
[3,3] => [3,3] => [3,3] => ([(2,5),(3,5),(4,5)],6)
=> 0 = 1 - 1
[4,2] => [2,4] => [4,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> 0 = 1 - 1
[5,1] => [1,5] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,1,1,4] => [4,1,1,1] => [1,1,1,4] => ([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1 = 2 - 1
[1,1,2,3] => [3,2,1,1] => [2,1,1,3] => ([(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 2 = 3 - 1
[1,1,5] => [5,1,1] => [1,1,5] => ([(4,5),(4,6),(5,6)],7)
=> 0 = 1 - 1
[1,2,4] => [4,2,1] => [2,1,4] => ([(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 0 = 1 - 1
[1,3,3] => [3,3,1] => [3,1,3] => ([(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 0 = 1 - 1
[1,4,2] => [2,4,1] => [4,1,2] => ([(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 0 = 1 - 1
[1,6] => [6,1] => [1,6] => ([(5,6)],7)
=> 0 = 1 - 1
[2,1,4] => [4,1,2] => [1,2,4] => ([(3,6),(4,5),(4,6),(5,6)],7)
=> 0 = 1 - 1
[2,2,3] => [3,2,2] => [2,2,3] => ([(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 0 = 1 - 1
[2,3,2] => [2,3,2] => [3,2,2] => ([(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 0 = 1 - 1
[2,5] => [5,2] => [2,5] => ([(4,6),(5,6)],7)
=> 0 = 1 - 1
[3,4] => [4,3] => [3,4] => ([(3,6),(4,6),(5,6)],7)
=> 0 = 1 - 1
[4,3] => [3,4] => [4,3] => ([(2,6),(3,6),(4,6),(5,6)],7)
=> 0 = 1 - 1
[5,2] => [2,5] => [5,2] => ([(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> 0 = 1 - 1
Description
The number of four-cliques in a graph.
Matching statistic: St001334
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00038: Integer compositions —reverse⟶ Integer compositions
Mp00173: Integer compositions —rotate front to back⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St001334: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00173: Integer compositions —rotate front to back⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St001334: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1] => [1,1] => [1,1] => ([(0,1)],2)
=> 0 = 1 - 1
[1,1,1] => [1,1,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 0 = 1 - 1
[1,2] => [2,1] => [1,2] => ([(1,2)],3)
=> 0 = 1 - 1
[2,1] => [1,2] => [2,1] => ([(0,2),(1,2)],3)
=> 0 = 1 - 1
[1,1,1,1] => [1,1,1,1] => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,1,2] => [2,1,1] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 0 = 1 - 1
[1,2,1] => [1,2,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0 = 1 - 1
[1,3] => [3,1] => [1,3] => ([(2,3)],4)
=> 0 = 1 - 1
[2,1,1] => [1,1,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 0 = 1 - 1
[2,2] => [2,2] => [2,2] => ([(1,3),(2,3)],4)
=> 0 = 1 - 1
[3,1] => [1,3] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 0 = 1 - 1
[1,1,1,2] => [2,1,1,1] => [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,2,1] => [1,2,1,1] => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
[1,1,3] => [3,1,1] => [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,2,2] => [2,2,1] => [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,3,1] => [1,3,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,4] => [4,1] => [1,4] => ([(3,4)],5)
=> 0 = 1 - 1
[2,1,2] => [2,1,2] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[2,2,1] => [1,2,2] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[2,3] => [3,2] => [2,3] => ([(2,4),(3,4)],5)
=> 0 = 1 - 1
[3,2] => [2,3] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
[4,1] => [1,4] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,1,1,3] => [3,1,1,1] => [1,1,1,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1 = 2 - 1
[1,1,2,2] => [2,2,1,1] => [2,1,1,2] => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
[1,1,4] => [4,1,1] => [1,1,4] => ([(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,2,3] => [3,2,1] => [2,1,3] => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,3,2] => [2,3,1] => [3,1,2] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,4,1] => [1,4,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 - 1
[1,5] => [5,1] => [1,5] => ([(4,5)],6)
=> 0 = 1 - 1
[2,1,3] => [3,1,2] => [1,2,3] => ([(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
[2,2,2] => [2,2,2] => [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
[2,3,1] => [1,3,2] => [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
[2,4] => [4,2] => [2,4] => ([(3,5),(4,5)],6)
=> 0 = 1 - 1
[3,3] => [3,3] => [3,3] => ([(2,5),(3,5),(4,5)],6)
=> 0 = 1 - 1
[4,2] => [2,4] => [4,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> 0 = 1 - 1
[5,1] => [1,5] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,1,1,4] => [4,1,1,1] => [1,1,1,4] => ([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1 = 2 - 1
[1,1,2,3] => [3,2,1,1] => [2,1,1,3] => ([(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 2 = 3 - 1
[1,1,5] => [5,1,1] => [1,1,5] => ([(4,5),(4,6),(5,6)],7)
=> 0 = 1 - 1
[1,2,4] => [4,2,1] => [2,1,4] => ([(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 0 = 1 - 1
[1,3,3] => [3,3,1] => [3,1,3] => ([(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 0 = 1 - 1
[1,4,2] => [2,4,1] => [4,1,2] => ([(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 0 = 1 - 1
[1,6] => [6,1] => [1,6] => ([(5,6)],7)
=> 0 = 1 - 1
[2,1,4] => [4,1,2] => [1,2,4] => ([(3,6),(4,5),(4,6),(5,6)],7)
=> 0 = 1 - 1
[2,2,3] => [3,2,2] => [2,2,3] => ([(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 0 = 1 - 1
[2,3,2] => [2,3,2] => [3,2,2] => ([(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 0 = 1 - 1
[2,5] => [5,2] => [2,5] => ([(4,6),(5,6)],7)
=> 0 = 1 - 1
[3,4] => [4,3] => [3,4] => ([(3,6),(4,6),(5,6)],7)
=> 0 = 1 - 1
[4,3] => [3,4] => [4,3] => ([(2,6),(3,6),(4,6),(5,6)],7)
=> 0 = 1 - 1
[5,2] => [2,5] => [5,2] => ([(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> 0 = 1 - 1
Description
The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph.
A graph is $3$-colourable if and only if in any linear ordering of its vertices, there are no four vertices $a < b < c < d$ such that $(a,b), (b,c)$ and $(c,d)$ are edges. This statistic is the minimal number of occurrences of this pattern, in the set of all linear orderings of the vertices.
Matching statistic: St001363
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Values
[1,1] => ([(0,1)],2)
=> ([],1)
=> 1
[1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2] => ([(1,2)],3)
=> ([],1)
=> 1
[2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
[1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2
[1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3] => ([(2,3)],4)
=> ([],1)
=> 1
[2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[2,2] => ([(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
[3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2
[1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ? = 3
[1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,4] => ([(3,4)],5)
=> ([],1)
=> 1
[2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[2,3] => ([(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1
[3,2] => ([(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,1,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2
[1,1,2,2] => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ? = 3
[1,1,4] => ([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,3] => ([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(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
[1,5] => ([(4,5)],6)
=> ([],1)
=> 1
[2,1,3] => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,5),(0,6),(1,4),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[2,4] => ([(3,5),(4,5)],6)
=> ([(0,1)],2)
=> 1
[3,3] => ([(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[4,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[5,1] => ([(0,5),(1,5),(2,5),(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)
=> 1
[1,1,1,4] => ([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2
[1,1,2,3] => ([(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ? = 3
[1,1,5] => ([(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,4] => ([(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3,3] => ([(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(1,2),(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)
=> ([(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
[1,6] => ([(5,6)],7)
=> ([],1)
=> 1
[2,1,4] => ([(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[2,2,3] => ([(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[2,3,2] => ([(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,5),(0,6),(1,4),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[2,5] => ([(4,6),(5,6)],7)
=> ([(0,1)],2)
=> 1
[3,4] => ([(3,6),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[4,3] => ([(2,6),(3,6),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[5,2] => ([(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> ([(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
Description
The Euler characteristic of a graph according to Knill.
This is $$\sum_{k\geq 1} (-1)^{k-1} c_k,$$
where $c_k$ is the number of cliques with $k$ vertices.
Matching statistic: St000405
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00143: Dyck paths —inverse promotion⟶ Dyck paths
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
St000405: Permutations ⟶ ℤResult quality: 94% ●values known / values provided: 94%●distinct values known / distinct values provided: 100%
Mp00143: Dyck paths —inverse promotion⟶ Dyck paths
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
St000405: Permutations ⟶ ℤResult quality: 94% ●values known / values provided: 94%●distinct values known / distinct values provided: 100%
Values
[1,1] => [1,0,1,0]
=> [1,1,0,0]
=> [1,2] => 0 = 1 - 1
[1,1,1] => [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,3,2] => 0 = 1 - 1
[1,2] => [1,0,1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,2,3] => 0 = 1 - 1
[2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [2,3,1] => 0 = 1 - 1
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 1 = 2 - 1
[1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,3,4,2] => 0 = 1 - 1
[1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,4,2,3] => 0 = 1 - 1
[1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 0 = 1 - 1
[2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> [2,3,1,4] => 0 = 1 - 1
[2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [2,3,4,1] => 0 = 1 - 1
[3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [3,4,1,2] => 0 = 1 - 1
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => 1 = 2 - 1
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,3,2,4,5] => 2 = 3 - 1
[1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,3,4,5,2] => 0 = 1 - 1
[1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,4,5,2,3] => 0 = 1 - 1
[1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,5,2,3,4] => 0 = 1 - 1
[1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => 0 = 1 - 1
[2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => 0 = 1 - 1
[2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [2,3,1,4,5] => 0 = 1 - 1
[2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => 0 = 1 - 1
[3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => 0 = 1 - 1
[4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [4,5,1,2,3] => 0 = 1 - 1
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,3,5,6,2,4] => 1 = 2 - 1
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,3,6,2,4,5] => 2 = 3 - 1
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,3,4,5,6,2] => 0 = 1 - 1
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,4,5,6,2,3] => 0 = 1 - 1
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [1,5,6,2,3,4] => 0 = 1 - 1
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,6,2,3,4,5] => 0 = 1 - 1
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,2,3,4,5,6] => 0 = 1 - 1
[2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,0,1,1,0,1,1,1,0,0,0,0]
=> [2,3,5,6,1,4] => 0 = 1 - 1
[2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0]
=> [2,3,6,1,4,5] => 0 = 1 - 1
[2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [2,3,1,4,5,6] => 0 = 1 - 1
[2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => 0 = 1 - 1
[3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> [3,4,5,6,1,2] => 0 = 1 - 1
[4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> [4,5,6,1,2,3] => 0 = 1 - 1
[5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> [5,6,1,2,3,4] => 0 = 1 - 1
[1,1,1,4] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,1,1,1,0,0,0,0,0]
=> [1,3,5,6,7,2,4] => 1 = 2 - 1
[1,1,2,3] => [1,0,1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,1,1,0,0,0,0]
=> [1,3,6,7,2,4,5] => 2 = 3 - 1
[1,1,5] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,1,1,1,0,0,0,0,0,0]
=> [1,3,4,5,6,7,2] => 0 = 1 - 1
[1,2,4] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,1,1,1,0,0,0,0,0]
=> [1,4,5,6,7,2,3] => 0 = 1 - 1
[1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,1,1,0,0,0,0]
=> [1,5,6,7,2,3,4] => 0 = 1 - 1
[1,4,2] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,1,0,0,0]
=> [1,6,7,2,3,4,5] => 0 = 1 - 1
[1,6] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,2,3,4,5,6,7] => 0 = 1 - 1
[2,1,4] => [1,1,0,0,1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,1,1,0,0,0,0,0]
=> [2,3,5,6,7,1,4] => 0 = 1 - 1
[2,2,3] => [1,1,0,0,1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,1,1,0,0,0,0]
=> [2,3,6,7,1,4,5] => ? = 1 - 1
[2,3,2] => [1,1,0,0,1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,1,1,0,0,0]
=> [2,3,7,1,4,5,6] => ? = 1 - 1
[2,5] => [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]
=> [2,3,4,5,6,7,1] => 0 = 1 - 1
[3,4] => [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]
=> [3,4,5,6,7,1,2] => 0 = 1 - 1
[4,3] => [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]
=> [4,5,6,7,1,2,3] => ? = 1 - 1
[5,2] => [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]
=> [5,6,7,1,2,3,4] => 0 = 1 - 1
[6,1] => [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]
=> [6,7,1,2,3,4,5] => 0 = 1 - 1
Description
The number of occurrences of the pattern 1324 in a permutation.
There is no explicit formula known for the number of permutations avoiding this pattern (denoted by $S_n(1324)$), but it is shown in [1], improving bounds in [2] and [3] that
$$\lim_{n \rightarrow \infty} \sqrt[n]{S_n(1324)} \leq 13.73718.$$
The following 173 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
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. St000274The number of perfect matchings of a graph. St000310The minimal degree of a vertex of a graph. St001722The number of minimal chains with small intervals between a binary word and the top element. St000379The number of Hamiltonian cycles in a graph. St000544The cop number of a graph. St000622The number of occurrences of the patterns 2143 or 4231 in a permutation. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St000454The largest eigenvalue of a graph if it is integral. St000260The radius of a connected graph. St000259The diameter of a connected graph. St000455The second largest eigenvalue of a graph if it is integral. St000735The last entry on the main diagonal of a standard tableau. St000661The number of rises of length 3 of a Dyck path. St000699The toughness times the least common multiple of 1,. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St000931The number of occurrences of the pattern UUU in a Dyck path. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001141The number of occurrences of hills of size 3 in a Dyck path. St000782The indicator function of whether a given perfect matching is an L & P matching. St001556The number of inversions of the third entry 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)$. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001371The length of the longest Yamanouchi prefix of a binary word. St001730The number of times the path corresponding to a binary word crosses the base line. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. 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. St001720The minimal length of a chain of small intervals in a lattice. St001846The number of elements which do not have a complement in the lattice. St000264The girth of a graph, which is not a tree. St001498The normalised height of a Nakayama algebra with magnitude 1. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001490The number of connected components of a skew partition. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001645The pebbling number of a connected graph. St000068The number of minimal elements in a poset. St000456The monochromatic index of a connected graph. St001487The number of inner corners of a skew partition. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St000486The number of cycles of length at least 3 of a permutation. St000627The exponent of a binary word. St000968We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n−1}]$ by adding $c_0$ to $c_{n−1}$. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001413Half the length of the longest even length palindromic prefix of a binary word. St001884The number of borders of a binary word. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St001423The number of distinct cubes in a binary word. St001549The number of restricted non-inversions between exceedances. St001566The length of the longest arithmetic progression in a permutation. 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. St000046The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition. St000137The Grundy value of an integer partition. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000460The hook length of the last cell along the main diagonal of an integer partition. St000618The number of self-evacuating tableaux of given shape. St000667The greatest common divisor of the parts of the partition. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000781The number of proper colouring schemes of a Ferrers diagram. St000870The product of the hook lengths of the diagonal cells in an integer partition. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001249Sum of the odd parts of a partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001262The dimension of the maximal parabolic seaweed algebra corresponding to the partition. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. St001360The number of covering relations in Young's lattice below a partition. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001378The product of the cohook lengths of the integer partition. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001383The BG-rank of an integer partition. St001389The number of partitions of the same length below the given integer partition. St001432The order dimension of the partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001525The number of symmetric hooks on the diagonal of a partition. St001527The cyclic permutation representation number of an integer partition. St001529The number of monomials in the expansion of the nabla operator applied to the power-sum symmetric function indexed by the partition. St001561The value of the elementary symmetric function evaluated at 1. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. St001571The Cartan determinant of the integer partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001600The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple graphs. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001602The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on endofunctions. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001607The number of coloured graphs such that the multiplicities of colours are given by a partition. St001608The number of coloured rooted trees such that the multiplicities of colours are given by a partition. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001610The number of coloured endofunctions such that the multiplicities of colours are given by a partition. St001611The number of multiset partitions such that the multiplicities of elements are given by a partition. St001627The number of coloured connected graphs such that the multiplicities of colours are given by a partition. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001763The Hurwitz number of an integer partition. St001780The order of promotion on the set of standard tableaux of given shape. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001924The number of cells in an integer partition whose arm and leg length coincide. St001933The largest multiplicity of a part in an integer partition. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001938The number of transitive monotone factorizations of genus zero of a permutation of given cycle type. St001939The number of parts that are equal to their multiplicity in the integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St001943The sum of the squares of the hook lengths of an integer partition. St000145The Dyson rank of a partition. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000225Difference between largest and smallest parts in a partition. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. St000944The 3-degree of an integer partition. St001175The size of a partition minus the hook length of the base cell. St001176The size of a partition minus its first part. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. St001248Sum of the even parts of a partition. St001279The sum of the parts of an integer partition that are at least two. St001280The number of parts of an integer partition that are at least two. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001541The Gini index of an integer partition. St001586The number of odd parts smaller than the largest even part in an integer partition. St001587Half of the largest even part of an integer partition. St001657The number of twos in an integer partition. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001961The sum of the greatest common divisors of all pairs of parts. St000474Dyson's crank of a partition. St001060The distinguishing index of a graph. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. 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. St000302The determinant of the distance matrix of a connected graph. St001301The first Betti number of the order complex associated with the poset. St001396Number of triples of incomparable elements in a finite poset. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St000706The product of the factorials of the multiplicities of an integer partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St000993The multiplicity of the largest part of an integer partition. St001568The smallest positive integer that does not appear twice in the partition. St000567The sum of the products of all pairs of parts. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000929The constant term of the character polynomial of an integer partition. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees.
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!