searching the database
Your data matches 489 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: St000098
(load all 11 compositions to match this statistic)
(load all 11 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> 1
([(0,1)],2)
=> ([],1)
=> 1
([],3)
=> ([],3)
=> 1
([(1,2)],3)
=> ([],2)
=> 1
([(0,2),(1,2)],3)
=> ([],1)
=> 1
([],4)
=> ([],4)
=> 1
([(2,3)],4)
=> ([],3)
=> 1
([(1,3),(2,3)],4)
=> ([],2)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([],1)
=> 1
([],5)
=> ([],5)
=> 1
([(3,4)],5)
=> ([],4)
=> 1
([(2,4),(3,4)],5)
=> ([],3)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([],2)
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 1
([(1,4),(2,3)],5)
=> ([],3)
=> 1
([(1,4),(2,3),(3,4)],5)
=> ([],2)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([],2)
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([],1)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([],1)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 3
([],6)
=> ([],6)
=> 1
([(4,5)],6)
=> ([],5)
=> 1
([(3,5),(4,5)],6)
=> ([],4)
=> 1
([(2,5),(3,5),(4,5)],6)
=> ([],3)
=> 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(2,5),(3,4)],6)
=> ([],4)
=> 1
([(2,5),(3,4),(4,5)],6)
=> ([],3)
=> 1
([(1,2),(3,5),(4,5)],6)
=> ([],3)
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([],2)
=> 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,4),(2,3)],6)
=> ([],3)
=> 1
([(1,5),(2,4),(3,4),(3,5)],6)
=> ([],2)
=> 1
([(0,1),(2,5),(3,4),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> 3
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 3
([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> ([],1)
=> 1
([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 3
([(5,6)],7)
=> ([],6)
=> 1
([(4,6),(5,6)],7)
=> ([],5)
=> 1
([(3,6),(4,6),(5,6)],7)
=> ([],4)
=> 1
([(2,6),(3,6),(4,6),(5,6)],7)
=> ([],3)
=> 1
Description
The chromatic number of a graph.
The minimal number of colors needed to color the vertices of the graph such that no two vertices which share an edge have the same color.
Matching statistic: St000172
(load all 11 compositions to match this statistic)
(load all 11 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> 1
([(0,1)],2)
=> ([],1)
=> 1
([],3)
=> ([],3)
=> 1
([(1,2)],3)
=> ([],2)
=> 1
([(0,2),(1,2)],3)
=> ([],1)
=> 1
([],4)
=> ([],4)
=> 1
([(2,3)],4)
=> ([],3)
=> 1
([(1,3),(2,3)],4)
=> ([],2)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([],1)
=> 1
([],5)
=> ([],5)
=> 1
([(3,4)],5)
=> ([],4)
=> 1
([(2,4),(3,4)],5)
=> ([],3)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([],2)
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 1
([(1,4),(2,3)],5)
=> ([],3)
=> 1
([(1,4),(2,3),(3,4)],5)
=> ([],2)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([],2)
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([],1)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([],1)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 3
([],6)
=> ([],6)
=> 1
([(4,5)],6)
=> ([],5)
=> 1
([(3,5),(4,5)],6)
=> ([],4)
=> 1
([(2,5),(3,5),(4,5)],6)
=> ([],3)
=> 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(2,5),(3,4)],6)
=> ([],4)
=> 1
([(2,5),(3,4),(4,5)],6)
=> ([],3)
=> 1
([(1,2),(3,5),(4,5)],6)
=> ([],3)
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([],2)
=> 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,4),(2,3)],6)
=> ([],3)
=> 1
([(1,5),(2,4),(3,4),(3,5)],6)
=> ([],2)
=> 1
([(0,1),(2,5),(3,4),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> 3
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 3
([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> ([],1)
=> 1
([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 3
([(5,6)],7)
=> ([],6)
=> 1
([(4,6),(5,6)],7)
=> ([],5)
=> 1
([(3,6),(4,6),(5,6)],7)
=> ([],4)
=> 1
([(2,6),(3,6),(4,6),(5,6)],7)
=> ([],3)
=> 1
Description
The Grundy number of a graph.
The Grundy number $\Gamma(G)$ is defined to be the largest $k$ such that $G$ admits a greedy $k$-coloring. Any order of the vertices of $G$ induces a greedy coloring by assigning to the $i$-th vertex in this order the smallest positive integer such that the partial coloring remains a proper coloring.
In particular, we have that $\chi(G) \leq \Gamma(G) \leq \Delta(G) + 1$, where $\chi(G)$ is the chromatic number of $G$ ([[St000098]]), and where $\Delta(G)$ is the maximal degree of a vertex of $G$ ([[St000171]]).
Matching statistic: St000822
(load all 11 compositions to match this statistic)
(load all 11 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> 1
([(0,1)],2)
=> ([],1)
=> 1
([],3)
=> ([],3)
=> 1
([(1,2)],3)
=> ([],2)
=> 1
([(0,2),(1,2)],3)
=> ([],1)
=> 1
([],4)
=> ([],4)
=> 1
([(2,3)],4)
=> ([],3)
=> 1
([(1,3),(2,3)],4)
=> ([],2)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([],1)
=> 1
([],5)
=> ([],5)
=> 1
([(3,4)],5)
=> ([],4)
=> 1
([(2,4),(3,4)],5)
=> ([],3)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([],2)
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 1
([(1,4),(2,3)],5)
=> ([],3)
=> 1
([(1,4),(2,3),(3,4)],5)
=> ([],2)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([],2)
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([],1)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([],1)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 3
([],6)
=> ([],6)
=> 1
([(4,5)],6)
=> ([],5)
=> 1
([(3,5),(4,5)],6)
=> ([],4)
=> 1
([(2,5),(3,5),(4,5)],6)
=> ([],3)
=> 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(2,5),(3,4)],6)
=> ([],4)
=> 1
([(2,5),(3,4),(4,5)],6)
=> ([],3)
=> 1
([(1,2),(3,5),(4,5)],6)
=> ([],3)
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([],2)
=> 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,4),(2,3)],6)
=> ([],3)
=> 1
([(1,5),(2,4),(3,4),(3,5)],6)
=> ([],2)
=> 1
([(0,1),(2,5),(3,4),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> 3
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 3
([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> ([],1)
=> 1
([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 3
([(5,6)],7)
=> ([],6)
=> 1
([(4,6),(5,6)],7)
=> ([],5)
=> 1
([(3,6),(4,6),(5,6)],7)
=> ([],4)
=> 1
([(2,6),(3,6),(4,6),(5,6)],7)
=> ([],3)
=> 1
Description
The Hadwiger number of the graph.
Also known as clique contraction number, this is the size of the largest complete minor.
Matching statistic: St001112
(load all 17 compositions to match this statistic)
(load all 17 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> 1
([(0,1)],2)
=> ([],1)
=> 1
([],3)
=> ([],3)
=> 1
([(1,2)],3)
=> ([],2)
=> 1
([(0,2),(1,2)],3)
=> ([],1)
=> 1
([],4)
=> ([],4)
=> 1
([(2,3)],4)
=> ([],3)
=> 1
([(1,3),(2,3)],4)
=> ([],2)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([],1)
=> 1
([],5)
=> ([],5)
=> 1
([(3,4)],5)
=> ([],4)
=> 1
([(2,4),(3,4)],5)
=> ([],3)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([],2)
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 1
([(1,4),(2,3)],5)
=> ([],3)
=> 1
([(1,4),(2,3),(3,4)],5)
=> ([],2)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([],2)
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([],1)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([],1)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 3
([],6)
=> ([],6)
=> 1
([(4,5)],6)
=> ([],5)
=> 1
([(3,5),(4,5)],6)
=> ([],4)
=> 1
([(2,5),(3,5),(4,5)],6)
=> ([],3)
=> 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(2,5),(3,4)],6)
=> ([],4)
=> 1
([(2,5),(3,4),(4,5)],6)
=> ([],3)
=> 1
([(1,2),(3,5),(4,5)],6)
=> ([],3)
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([],2)
=> 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,4),(2,3)],6)
=> ([],3)
=> 1
([(1,5),(2,4),(3,4),(3,5)],6)
=> ([],2)
=> 1
([(0,1),(2,5),(3,4),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> 3
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 3
([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> ([],1)
=> 1
([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 3
([(5,6)],7)
=> ([],6)
=> 1
([(4,6),(5,6)],7)
=> ([],5)
=> 1
([(3,6),(4,6),(5,6)],7)
=> ([],4)
=> 1
([(2,6),(3,6),(4,6),(5,6)],7)
=> ([],3)
=> 1
Description
The 3-weak dynamic number of a graph.
A $k$-weak-dynamic coloring of a graph $G$ is a (non-proper) coloring of $G$ in such a way that each vertex $v$ sees at least $\min\{d(v), k\}$ colors in its neighborhood. The $k$-weak-dynamic number of a graph is the smallest number of colors needed to find an $k$-dynamic coloring.
This statistic records the $3$-weak-dynamic number of a graph.
Matching statistic: St001116
(load all 11 compositions to match this statistic)
(load all 11 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> 1
([(0,1)],2)
=> ([],1)
=> 1
([],3)
=> ([],3)
=> 1
([(1,2)],3)
=> ([],2)
=> 1
([(0,2),(1,2)],3)
=> ([],1)
=> 1
([],4)
=> ([],4)
=> 1
([(2,3)],4)
=> ([],3)
=> 1
([(1,3),(2,3)],4)
=> ([],2)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([],1)
=> 1
([],5)
=> ([],5)
=> 1
([(3,4)],5)
=> ([],4)
=> 1
([(2,4),(3,4)],5)
=> ([],3)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([],2)
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 1
([(1,4),(2,3)],5)
=> ([],3)
=> 1
([(1,4),(2,3),(3,4)],5)
=> ([],2)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([],2)
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([],1)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([],1)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 3
([],6)
=> ([],6)
=> 1
([(4,5)],6)
=> ([],5)
=> 1
([(3,5),(4,5)],6)
=> ([],4)
=> 1
([(2,5),(3,5),(4,5)],6)
=> ([],3)
=> 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(2,5),(3,4)],6)
=> ([],4)
=> 1
([(2,5),(3,4),(4,5)],6)
=> ([],3)
=> 1
([(1,2),(3,5),(4,5)],6)
=> ([],3)
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([],2)
=> 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,4),(2,3)],6)
=> ([],3)
=> 1
([(1,5),(2,4),(3,4),(3,5)],6)
=> ([],2)
=> 1
([(0,1),(2,5),(3,4),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> 3
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 3
([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> ([],1)
=> 1
([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 3
([(5,6)],7)
=> ([],6)
=> 1
([(4,6),(5,6)],7)
=> ([],5)
=> 1
([(3,6),(4,6),(5,6)],7)
=> ([],4)
=> 1
([(2,6),(3,6),(4,6),(5,6)],7)
=> ([],3)
=> 1
Description
The game chromatic number of a graph.
Two players, Alice and Bob, take turns colouring properly any uncolored vertex of the graph. Alice begins. If it is not possible for either player to colour a vertex, then Bob wins. If the graph is completely colored, Alice wins.
The game chromatic number is the smallest number of colours such that Alice has a winning strategy.
Matching statistic: St001261
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> 1
([(0,1)],2)
=> ([],1)
=> 1
([],3)
=> ([],3)
=> 1
([(1,2)],3)
=> ([],2)
=> 1
([(0,2),(1,2)],3)
=> ([],1)
=> 1
([],4)
=> ([],4)
=> 1
([(2,3)],4)
=> ([],3)
=> 1
([(1,3),(2,3)],4)
=> ([],2)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([],1)
=> 1
([],5)
=> ([],5)
=> 1
([(3,4)],5)
=> ([],4)
=> 1
([(2,4),(3,4)],5)
=> ([],3)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([],2)
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 1
([(1,4),(2,3)],5)
=> ([],3)
=> 1
([(1,4),(2,3),(3,4)],5)
=> ([],2)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([],2)
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([],1)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([],1)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 3
([],6)
=> ([],6)
=> 1
([(4,5)],6)
=> ([],5)
=> 1
([(3,5),(4,5)],6)
=> ([],4)
=> 1
([(2,5),(3,5),(4,5)],6)
=> ([],3)
=> 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(2,5),(3,4)],6)
=> ([],4)
=> 1
([(2,5),(3,4),(4,5)],6)
=> ([],3)
=> 1
([(1,2),(3,5),(4,5)],6)
=> ([],3)
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([],2)
=> 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,4),(2,3)],6)
=> ([],3)
=> 1
([(1,5),(2,4),(3,4),(3,5)],6)
=> ([],2)
=> 1
([(0,1),(2,5),(3,4),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> 3
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 3
([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> ([],1)
=> 1
([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 3
([(5,6)],7)
=> ([],6)
=> 1
([(4,6),(5,6)],7)
=> ([],5)
=> 1
([(3,6),(4,6),(5,6)],7)
=> ([],4)
=> 1
([(2,6),(3,6),(4,6),(5,6)],7)
=> ([],3)
=> 1
Description
The Castelnuovo-Mumford regularity of a graph.
Matching statistic: St001494
(load all 12 compositions to match this statistic)
(load all 12 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> 1
([(0,1)],2)
=> ([],1)
=> 1
([],3)
=> ([],3)
=> 1
([(1,2)],3)
=> ([],2)
=> 1
([(0,2),(1,2)],3)
=> ([],1)
=> 1
([],4)
=> ([],4)
=> 1
([(2,3)],4)
=> ([],3)
=> 1
([(1,3),(2,3)],4)
=> ([],2)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([],1)
=> 1
([],5)
=> ([],5)
=> 1
([(3,4)],5)
=> ([],4)
=> 1
([(2,4),(3,4)],5)
=> ([],3)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([],2)
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 1
([(1,4),(2,3)],5)
=> ([],3)
=> 1
([(1,4),(2,3),(3,4)],5)
=> ([],2)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([],2)
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([],1)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([],1)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 3
([],6)
=> ([],6)
=> 1
([(4,5)],6)
=> ([],5)
=> 1
([(3,5),(4,5)],6)
=> ([],4)
=> 1
([(2,5),(3,5),(4,5)],6)
=> ([],3)
=> 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(2,5),(3,4)],6)
=> ([],4)
=> 1
([(2,5),(3,4),(4,5)],6)
=> ([],3)
=> 1
([(1,2),(3,5),(4,5)],6)
=> ([],3)
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([],2)
=> 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,4),(2,3)],6)
=> ([],3)
=> 1
([(1,5),(2,4),(3,4),(3,5)],6)
=> ([],2)
=> 1
([(0,1),(2,5),(3,4),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> 3
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 3
([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> ([],1)
=> 1
([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 3
([(5,6)],7)
=> ([],6)
=> 1
([(4,6),(5,6)],7)
=> ([],5)
=> 1
([(3,6),(4,6),(5,6)],7)
=> ([],4)
=> 1
([(2,6),(3,6),(4,6),(5,6)],7)
=> ([],3)
=> 1
Description
The Alon-Tarsi number of a graph.
Let $G$ be a graph with vertices $\{1,\dots,n\}$ and edge set $E$. Let $P_G=\prod_{i < j, (i,j)\in E} x_i-x_j$ be its graph polynomial. Then the Alon-Tarsi number is the smallest number $k$ such that $P_G$ contains a monomial with exponents strictly less than $k$.
Matching statistic: St001580
(load all 12 compositions to match this statistic)
(load all 12 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> 1
([(0,1)],2)
=> ([],1)
=> 1
([],3)
=> ([],3)
=> 1
([(1,2)],3)
=> ([],2)
=> 1
([(0,2),(1,2)],3)
=> ([],1)
=> 1
([],4)
=> ([],4)
=> 1
([(2,3)],4)
=> ([],3)
=> 1
([(1,3),(2,3)],4)
=> ([],2)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([],1)
=> 1
([],5)
=> ([],5)
=> 1
([(3,4)],5)
=> ([],4)
=> 1
([(2,4),(3,4)],5)
=> ([],3)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([],2)
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 1
([(1,4),(2,3)],5)
=> ([],3)
=> 1
([(1,4),(2,3),(3,4)],5)
=> ([],2)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([],2)
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([],1)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([],1)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 3
([],6)
=> ([],6)
=> 1
([(4,5)],6)
=> ([],5)
=> 1
([(3,5),(4,5)],6)
=> ([],4)
=> 1
([(2,5),(3,5),(4,5)],6)
=> ([],3)
=> 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(2,5),(3,4)],6)
=> ([],4)
=> 1
([(2,5),(3,4),(4,5)],6)
=> ([],3)
=> 1
([(1,2),(3,5),(4,5)],6)
=> ([],3)
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([],2)
=> 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,4),(2,3)],6)
=> ([],3)
=> 1
([(1,5),(2,4),(3,4),(3,5)],6)
=> ([],2)
=> 1
([(0,1),(2,5),(3,4),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> 3
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 3
([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> ([],1)
=> 1
([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 3
([(5,6)],7)
=> ([],6)
=> 1
([(4,6),(5,6)],7)
=> ([],5)
=> 1
([(3,6),(4,6),(5,6)],7)
=> ([],4)
=> 1
([(2,6),(3,6),(4,6),(5,6)],7)
=> ([],3)
=> 1
Description
The acyclic chromatic number of a graph.
This is the smallest size of a vertex partition $\{V_1,\dots,V_k\}$ such that each $V_i$ is an independent set and for all $i,j$ the subgraph inducted by $V_i\cup V_j$ does not contain a cycle.
Matching statistic: St001581
(load all 11 compositions to match this statistic)
(load all 11 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> 1
([(0,1)],2)
=> ([],1)
=> 1
([],3)
=> ([],3)
=> 1
([(1,2)],3)
=> ([],2)
=> 1
([(0,2),(1,2)],3)
=> ([],1)
=> 1
([],4)
=> ([],4)
=> 1
([(2,3)],4)
=> ([],3)
=> 1
([(1,3),(2,3)],4)
=> ([],2)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([],1)
=> 1
([],5)
=> ([],5)
=> 1
([(3,4)],5)
=> ([],4)
=> 1
([(2,4),(3,4)],5)
=> ([],3)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([],2)
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 1
([(1,4),(2,3)],5)
=> ([],3)
=> 1
([(1,4),(2,3),(3,4)],5)
=> ([],2)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([],2)
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([],1)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([],1)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 3
([],6)
=> ([],6)
=> 1
([(4,5)],6)
=> ([],5)
=> 1
([(3,5),(4,5)],6)
=> ([],4)
=> 1
([(2,5),(3,5),(4,5)],6)
=> ([],3)
=> 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(2,5),(3,4)],6)
=> ([],4)
=> 1
([(2,5),(3,4),(4,5)],6)
=> ([],3)
=> 1
([(1,2),(3,5),(4,5)],6)
=> ([],3)
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([],2)
=> 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,4),(2,3)],6)
=> ([],3)
=> 1
([(1,5),(2,4),(3,4),(3,5)],6)
=> ([],2)
=> 1
([(0,1),(2,5),(3,4),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> 3
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 3
([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> ([],1)
=> 1
([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 3
([(5,6)],7)
=> ([],6)
=> 1
([(4,6),(5,6)],7)
=> ([],5)
=> 1
([(3,6),(4,6),(5,6)],7)
=> ([],4)
=> 1
([(2,6),(3,6),(4,6),(5,6)],7)
=> ([],3)
=> 1
Description
The achromatic number of a graph.
This is the maximal number of colours of a proper colouring, such that for any pair of colours there are two adjacent vertices with these colours.
Matching statistic: St001670
(load all 11 compositions to match this statistic)
(load all 11 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> 1
([(0,1)],2)
=> ([],1)
=> 1
([],3)
=> ([],3)
=> 1
([(1,2)],3)
=> ([],2)
=> 1
([(0,2),(1,2)],3)
=> ([],1)
=> 1
([],4)
=> ([],4)
=> 1
([(2,3)],4)
=> ([],3)
=> 1
([(1,3),(2,3)],4)
=> ([],2)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([],1)
=> 1
([],5)
=> ([],5)
=> 1
([(3,4)],5)
=> ([],4)
=> 1
([(2,4),(3,4)],5)
=> ([],3)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([],2)
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 1
([(1,4),(2,3)],5)
=> ([],3)
=> 1
([(1,4),(2,3),(3,4)],5)
=> ([],2)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([],2)
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([],1)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([],1)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 3
([],6)
=> ([],6)
=> 1
([(4,5)],6)
=> ([],5)
=> 1
([(3,5),(4,5)],6)
=> ([],4)
=> 1
([(2,5),(3,5),(4,5)],6)
=> ([],3)
=> 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(2,5),(3,4)],6)
=> ([],4)
=> 1
([(2,5),(3,4),(4,5)],6)
=> ([],3)
=> 1
([(1,2),(3,5),(4,5)],6)
=> ([],3)
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([],2)
=> 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> ([],2)
=> 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([],1)
=> 1
([(0,5),(1,4),(2,3)],6)
=> ([],3)
=> 1
([(1,5),(2,4),(3,4),(3,5)],6)
=> ([],2)
=> 1
([(0,1),(2,5),(3,4),(4,5)],6)
=> ([],2)
=> 1
([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> 3
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 3
([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> ([],1)
=> 1
([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 3
([(5,6)],7)
=> ([],6)
=> 1
([(4,6),(5,6)],7)
=> ([],5)
=> 1
([(3,6),(4,6),(5,6)],7)
=> ([],4)
=> 1
([(2,6),(3,6),(4,6),(5,6)],7)
=> ([],3)
=> 1
Description
The connected partition number of a graph.
This is the maximal number of blocks of a set partition $P$ of the set of vertices of a graph such that contracting each block of $P$ to a single vertex yields a clique.
Also called the pseudoachromatic number of a graph. This is the largest $n$ such that there exists a (not necessarily proper) $n$-coloring of the graph so that every two distinct colors are adjacent.
The following 479 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000272The treewidth of a graph. St000535The rank-width of a graph. St000536The pathwidth of a graph. St001277The degeneracy of a graph. St001333The cardinality of a minimal edge-isolating set of a graph. St001358The largest degree of a regular subgraph of a graph. St001577The minimal number of edges to add or remove to make a graph a cograph. St001792The arboricity of a graph. St000258The burning number of a graph. St000271The chromatic index of a graph. St000387The matching number of a graph. St000452The number of distinct eigenvalues of a graph. St000453The number of distinct Laplacian eigenvalues of a graph. St000469The distinguishing number of a graph. St000636The hull number of a graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000820The number of compositions obtained by rotating the composition. St000918The 2-limited packing number of a graph. St001111The weak 2-dynamic chromatic number of a graph. St001315The dissociation number of a graph. St001476The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,-1). St001478The number of nowhere zero 4-flows of a graph. St001642The Prague dimension of a graph. St001655The general position number of a graph. St001672The restrained domination number of a graph. St001674The number of vertices of the largest induced star graph in the graph. St001734The lettericity of a graph. St001883The mutual visibility number of a graph. St000171The degree of the graph. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000310The minimal degree of a vertex of a graph. St000351The determinant of the adjacency matrix of a graph. St000454The largest eigenvalue of a graph if it is integral. St000537The cutwidth of a graph. St000778The metric dimension of a graph. St001270The bandwidth of a graph. St001271The competition number of a graph. St001326The minimal number of occurrences of the interval-pattern in a linear ordering of the vertices of the graph. St001331The size of the minimal feedback vertex set. St001340The cardinality of a minimal non-edge isolating set of a graph. St001357The maximal degree of a regular spanning subgraph of a graph. St001644The dimension of a graph. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001703The villainy of a graph. St001743The discrepancy of a graph. St001777The number of weak descents in an integer composition. St001949The rigidity index of a graph. St001962The proper pathwidth of a graph. St000267The number of maximal spanning forests contained in a graph. St000763The sum of the positions of the strong records of an integer composition. St000765The number of weak records in an integer composition. St001546The number of monomials in the Tutte polynomial of a graph. St001694The number of maximal dissociation sets in a graph. St000995The largest even part of an integer partition. St001814The number of partitions interlacing the given partition. St000741The Colin de Verdière graph invariant. St000422The energy of a graph, if it is integral. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000068The number of minimal elements in a poset. St001330The hat guessing number of a graph. St000965The sum of the dimension of Ext^i(D(A),A) for i=1,. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001873For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between $e_i J$ and $e_j J$ (the radical of the indecomposable projective modules). St001498The normalised height of a Nakayama algebra with magnitude 1. St001651The Frankl number of a lattice. St001118The acyclic chromatic index of a graph. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St000514The number of invariant simple graphs when acting with a permutation of given cycle type. St000455The second largest eigenvalue of a graph if it is integral. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. 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. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001845The number of join irreducibles minus the rank of a lattice. St001846The number of elements which do not have a complement in the lattice. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St000069The number of maximal elements of a poset. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000264The girth of a graph, which is not a tree. St000644The number of graphs with given frequency partition. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St001286The annihilation number of a graph. St001512The minimum rank of a graph. St001591The number of graphs with the given composition of multiplicities of Laplacian eigenvalues. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001716The 1-improper chromatic number of a graph. St000143The largest repeated part of a partition. St000149The number of cells of the partition whose leg is zero and arm is odd. St000150The floored half-sum of the multiplicities of a partition. St000299The number of nonisomorphic vertex-induced subtrees. St000766The number of inversions of an integer composition. St000769The major index of a composition regarded as a word. St001093The detour number of a graph. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001742The difference of the maximal and the minimal degree in a graph. St001798The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St000010The length of the partition. St000047The number of standard immaculate tableaux of a given shape. St000093The cardinality of a maximal independent set of vertices of a graph. St000096The number of spanning trees of a graph. St000212The number of standard Young tableaux for an integer partition such that no two consecutive entries appear in the same row. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000321The number of integer partitions of n that are dominated by an integer partition. St000345The number of refinements of a partition. St000378The diagonal inversion number of an integer partition. St000390The number of runs of ones in a binary word. St000443The number of long tunnels of a Dyck path. St000450The number of edges minus the number of vertices plus 2 of a graph. St000482The (zero)-forcing number of a graph. St000549The number of odd partial sums of an integer partition. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000767The number of runs in an integer composition. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000808The number of up steps of the associated bargraph. St000935The number of ordered refinements of an integer partition. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001014Number of indecomposable injective modules with codominant dimension equal to the dominant dimension of the Nakayama algebra corresponding to the Dyck path. St001015Number of indecomposable injective modules with codominant dimension equal to one in the Nakayama algebra corresponding to the Dyck path. St001016Number of indecomposable injective modules with codominant dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001057The Grundy value of the game of creating an independent set in a graph. St001063Numbers of 3-torsionfree simple modules in the corresponding Nakayama algebra. St001064Number of simple modules in the corresponding Nakayama algebra that are 3-syzygy modules. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001102The number of words with multiplicities of the letters given by the composition, avoiding the consecutive pattern 132. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001282The number of graphs with the same chromatic polynomial. St001297The number of indecomposable non-injective projective modules minus the number of indecomposable non-injective projective modules that have reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001312Number of parabolic noncrossing partitions indexed by the composition. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001389The number of partitions of the same length below the given integer partition. St001463The number of distinct columns in the nullspace of a graph. St001487The number of inner corners of a skew partition. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001739The number of graphs with the same edge polytope as the given graph. St001796The absolute value of the quotient of the Tutte polynomial of the graph at (1,1) and (-1,-1). St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001924The number of cells in an integer partition whose arm and leg length coincide. St000008The major index of the composition. St000012The area of a Dyck path. St000024The number of double up and double down steps of a Dyck path. St000089The absolute variation of a composition. St000095The number of triangles of a graph. St000097The order of the largest clique of the graph. St000142The number of even parts of a partition. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000291The number of descents of a binary word. St000292The number of ascents of a binary word. St000313The number of degree 2 vertices of a graph. St000377The dinv defect of an integer partition. St000386The number of factors DDU in a Dyck path. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000403The Szeged index minus the Wiener index of a graph. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000547The number of even non-empty partial sums of an integer partition. St000671The maximin edge-connectivity for choosing a subgraph. St000676The number of odd rises of a Dyck path. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000921The number of internal inversions of a binary word. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001180Number of indecomposable injective modules with projective dimension at most 1. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001211The number of simple modules in the corresponding Nakayama algebra that have vanishing second Ext-group with the regular module. St001214The aft of an integer partition. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001251The number of parts of a partition that are not congruent 1 modulo 3. St001252Half the sum of the even parts of a partition. St001263The index of the maximal parabolic seaweed algebra associated with the composition. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St001280The number of parts of an integer partition that are at least two. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001311The cyclomatic number of a graph. St001317The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the graph. St001319The minimal number of occurrences of the star-pattern in a linear ordering of the vertices of the graph. St001323The independence gap of a graph. St001328The minimal number of occurrences of the bipartite-pattern in a linear ordering of the vertices of the graph. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001420Half the length of a longest factor which is its own reverse-complement of a binary word. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001435The number of missing boxes in the first row. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001492The number of simple modules that do not appear in the socle of the regular module or have no nontrivial selfextensions with the regular module in the corresponding Nakayama algebra. St001524The degree of symmetry of a binary word. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001592The maximal number of simple paths between any two different vertices of a graph. St001638The book thickness of a graph. St001647The number of edges that can be added without increasing the clique number. St001648The number of edges that can be added without increasing the chromatic number. St001657The number of twos in an integer partition. St001689The number of celebrities in a graph. St001690The length of a longest path in a graph such that after removing the paths edges, every vertex of the path has distance two from some other vertex of the path. St001692The number of vertices with higher degree than the average degree in a graph. St001746The coalition number of a graph. St001931The weak major index of an integer composition regarded as a word. St001002Number of indecomposable modules with projective and injective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St000879The number of long braid edges in the graph of braid moves of a permutation. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St000950Number of tilting modules of the corresponding LNakayama algebra, where a tilting module is a generalised tilting module of projective dimension 1. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001256Number of simple reflexive modules that are 2-stable reflexive. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. 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. St001608The number of coloured rooted trees such that the multiplicities of colours are given by a partition. St001624The breadth of a lattice. 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. St001681The number of inclusion-wise minimal subsets of a lattice, whose meet is the bottom element. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St001763The Hurwitz number of an integer partition. St001881The number of factors of a lattice as a Cartesian product of lattices. 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. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. 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$. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001623The number of doubly irreducible elements of a lattice. St001677The number of non-degenerate subsets of a lattice whose meet is the bottom element. St001872The number of indecomposable injective modules with even projective dimension in the corresponding Nakayama algebra. 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. St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. 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}$. St001191Number of simple modules $S$ with $Ext_A^i(S,A)=0$ for all $i=0,1,...,g-1$ in the corresponding Nakayama algebra $A$ with global dimension $g$. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001616The number of neutral elements in a lattice. St001618The cardinality of the Frattini sublattice of a lattice. St001625The Möbius invariant of a lattice. St001679The number of subsets of a lattice whose meet is the bottom element. St001720The minimal length of a chain of small intervals in a lattice. St001754The number of tolerances of a finite lattice. St001833The number of linear intervals in a lattice. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St001193The dimension of $Ext_A^1(A/AeA,A)$ in the corresponding Nakayama algebra $A$ such that $eA$ is a minimal faithful projective-injective module. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001234The number of indecomposable three dimensional modules with projective dimension one. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001545The second Elser number of a connected graph. St001613The binary logarithm of the size of the center of a lattice. St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St001619The number of non-isomorphic sublattices of a lattice. St001620The number of sublattices of a lattice. St001621The number of atoms of a lattice. St001622The number of join-irreducible elements of a lattice. St001626The number of maximal proper sublattices of a lattice. St001666The number of non-isomorphic subposets of a lattice which are lattices. St001473The absolute value of the sum of all entries of the Coxeter matrix of the corresponding LNakayama algebra. St000478Another weight of a partition according to Alladi. St000934The 2-degree of an integer partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St000940The number of characters of the symmetric group whose value on the partition is zero. St000941The number of characters of the symmetric group whose value on the partition is even. St001281The normalized isoperimetric number of a graph. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St000806The semiperimeter of the associated bargraph. St000456The monochromatic index of a connected graph. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000675The number of centered multitunnels of a Dyck path. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000762The sum of the positions of the weak records of an integer composition. St000937The number of positive values of the symmetric group character corresponding to the partition. St000376The bounce deficit of a Dyck path. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000658The number of rises of length 2 of a Dyck path. St000659The number of rises of length at least 2 of a Dyck path. St000683The number of points below the Dyck path such that the diagonal to the north-east hits the path between two down steps, and the diagonal to the north-west hits the path between two up steps. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000770The major index of an integer partition when read from bottom to top. St000817The sum of the entries in the column specified by the composition of the change of basis matrix from dual immaculate quasisymmetric functions to monomial quasisymmetric functions. St000933The number of multipartitions of sizes given by an integer partition. St000984The number of boxes below precisely one peak. St001139The number of occurrences of hills of size 2 in a Dyck path. St001480The number of simple summands of the module J^2/J^3. St001500The global dimension of magnitude 1 Nakayama algebras. St000477The weight of a partition according to Alladi. St000928The sum of the coefficients of the character polynomial of an integer partition. St001695The natural comajor index of a standard Young tableau. St001698The comajor index of a standard tableau minus the weighted size of its shape. St001699The major index of a standard tableau minus the weighted size of its shape. St001712The number of natural descents of a standard Young tableau. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St000056The decomposition (or block) number of a permutation. St000486The number of cycles of length at least 3 of a permutation. St000694The number of affine bounded permutations that project to a given permutation. St000788The number of nesting-similar perfect matchings of a perfect matching. 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)$. 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)$. St001461The number of topologically connected components of the chord diagram of a permutation. St001590The crossing number of a perfect matching. St001830The chord expansion number of a perfect matching. St001832The number of non-crossing perfect matchings in the chord expansion of a perfect matching. St001859The number of factors of the Stanley symmetric function associated with a permutation. St000221The number of strong fixed points of a permutation. St000279The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St000623The number of occurrences of the pattern 52341 in a permutation. St000787The number of flips required to make a perfect matching noncrossing. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001381The fertility of a permutation. St001444The rank of the skew-symmetric form which is non-zero on crossing arcs of a perfect matching. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001549The number of restricted non-inversions between exceedances. 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. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St001810The number of fixed points of a permutation smaller than its largest moved point. St001811The Castelnuovo-Mumford regularity of a permutation. St001837The number of occurrences of a 312 pattern in the restricted growth word of a perfect matching. St001850The number of Hecke atoms of a permutation. St000379The number of Hamiltonian cycles in a graph. St000699The toughness times the least common multiple of 1,. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St000480The number of lower covers of a partition in dominance order. St000475The number of parts equal to 1 in a partition. St000929The constant term of the character polynomial of an integer partition. St000284The Plancherel distribution on integer partitions. St000668The least common multiple of the parts of the partition. St000815The number of semistandard Young tableaux of partition weight of given shape. St000901The cube of the number of standard Young tableaux with shape given by the partition. St001128The exponens consonantiae of a partition. St000936The number of even values of the symmetric group character corresponding to the partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001568The smallest positive integer that does not appear twice in the partition. St001890The maximum magnitude of the Möbius function of a poset. St000781The number of proper colouring schemes of a Ferrers diagram. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001175The size of a partition minus the hook length of the base cell. St000464The Schultz index of a connected graph. St001322The size of a minimal independent dominating set in a graph. St001339The irredundance number of a graph. St001363The Euler characteristic of a graph according to Knill. St001496The number of graphs with the same Laplacian spectrum as the given graph. St001305The number of induced cycles on four vertices in a graph. St001324The minimal number of occurrences of the chordal-pattern in a linear ordering of the vertices of the graph. St001325The minimal number of occurrences of the comparability-pattern in a linear ordering of the vertices of the graph. St001367The smallest number which does not occur as degree of a vertex in a graph. St001479The number of bridges of a graph. 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. St000181The number of connected components of the Hasse diagram for the poset. St000908The length of the shortest maximal antichain in a poset. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001533The largest coefficient of the Poincare polynomial of the poset cone. St001877Number of indecomposable injective modules with projective dimension 2. St001301The first Betti number of the order complex associated with the poset. St001396Number of triples of incomparable elements in a finite poset. St001964The interval resolution global dimension of a poset. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St001570The minimal number of edges to add to make a graph Hamiltonian. St000256The number of parts from which one can substract 2 and still get an integer partition. St000544The cop number of a graph. St000553The number of blocks of a graph. St000775The multiplicity of the largest eigenvalue in a graph. St001740The number of graphs with the same symmetric edge polytope as the given graph. St000449The number of pairs of vertices of a graph with distance 4. St000552The number of cut vertices of a graph. St001793The difference between the clique number and the chromatic number of a graph. St001490The number of connected components of a skew partition. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. 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. St000914The sum of the values of the Möbius function of a poset. St001095The number of non-isomorphic posets with precisely one further covering relation. St001307The number of induced stars on four vertices in a graph. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000287The number of connected components of a graph. St001060The distinguishing index of a graph. St001518The number of graphs with the same ordinary spectrum as the given graph. St001765The number of connected components of the friends and strangers graph. St000322The skewness of a graph. St001438The number of missing boxes of a skew partition. St001578The minimal number of edges to add or remove to make a graph a line graph. St001875The number of simple modules with projective dimension at most 1. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001803The maximal overlap of the cylindrical tableau associated with a tableau. 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. St001432The order dimension of the partition. St001571The Cartan determinant of the integer partition. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St001780The order of promotion on the set of standard tableaux of given shape. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001914The size of the orbit of an integer partition in Bulgarian solitaire. 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. St000225Difference between largest and smallest parts in a partition. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000713The dimension of the irreducible representation of Sp(4) labelled by an integer partition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000716The dimension of the irreducible representation of Sp(6) labelled by an integer 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. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to 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. St001383The BG-rank of an integer partition. 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. St001525The number of symmetric hooks on the diagonal of a 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. St001593This is the number of standard Young tableaux of the given shifted shape. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. 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. St000286The number of connected components of the complement of a graph. St000315The number of isolated vertices of a graph. St000274The number of perfect matchings of a graph. St000276The size of the preimage of the map 'to graph' from Ordered trees to Graphs. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by $4$. St000447The number of pairs of vertices of a graph with distance 3. St001871The number of triconnected components of a graph. 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. 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. St001527The cyclic permutation representation number of an integer partition. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001602The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on endofunctions. 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. St001529The number of monomials in the expansion of the nabla operator applied to the power-sum symmetric function indexed by the partition.
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!