searching the database
Your data matches 721 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: St000097
(load all 26 compositions to match this statistic)
(load all 26 compositions to match this statistic)
Values
([(0,1),(0,2),(1,2)],3)
=> 3 = -1 + 4
([(1,2),(1,3),(2,3)],4)
=> 3 = -1 + 4
([(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = -1 + 4
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = -1 + 4
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4 = 0 + 4
([(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,1),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 0 + 4
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 0 + 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 0 + 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 3 = -1 + 4
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 0 + 4
([(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,2),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
Description
The order of the largest clique of the graph.
A clique in a graph $G$ is a subset $U \subseteq V(G)$ such that any pair of vertices in $U$ are adjacent. I.e. the subgraph induced by $U$ is a complete graph.
Matching statistic: St000098
(load all 26 compositions to match this statistic)
(load all 26 compositions to match this statistic)
Values
([(0,1),(0,2),(1,2)],3)
=> 3 = -1 + 4
([(1,2),(1,3),(2,3)],4)
=> 3 = -1 + 4
([(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = -1 + 4
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = -1 + 4
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4 = 0 + 4
([(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,1),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 0 + 4
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 0 + 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 0 + 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 3 = -1 + 4
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 0 + 4
([(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,2),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
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: St001029
(load all 26 compositions to match this statistic)
(load all 26 compositions to match this statistic)
Values
([(0,1),(0,2),(1,2)],3)
=> 3 = -1 + 4
([(1,2),(1,3),(2,3)],4)
=> 3 = -1 + 4
([(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = -1 + 4
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = -1 + 4
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4 = 0 + 4
([(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,1),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 0 + 4
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 0 + 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 0 + 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 3 = -1 + 4
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 0 + 4
([(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,2),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
Description
The size of the core of a graph.
The core of the graph $G$ is the smallest graph $C$ such that there is a graph homomorphism from $G$ to $C$ and a graph homomorphism from $C$ to $G$.
Matching statistic: St001494
(load all 26 compositions to match this statistic)
(load all 26 compositions to match this statistic)
Values
([(0,1),(0,2),(1,2)],3)
=> 3 = -1 + 4
([(1,2),(1,3),(2,3)],4)
=> 3 = -1 + 4
([(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = -1 + 4
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = -1 + 4
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4 = 0 + 4
([(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,1),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 0 + 4
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 0 + 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 0 + 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 3 = -1 + 4
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 3 = -1 + 4
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 0 + 4
([(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,2),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = -1 + 4
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: St000671
Values
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
Description
The maximin edge-connectivity for choosing a subgraph.
This is $\max_X \min(\lambda(G[X]), \lambda(G[V\setminus X]))$, where $X$ ranges over all subsets of the vertex set $V$ and $\lambda$ is the edge-connectivity of a graph.
Matching statistic: St001056
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
Description
The Grundy value for the game of deleting vertices of a graph until it has no edges.
Matching statistic: St001309
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Values
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
Description
The number of four-cliques in a graph.
Matching statistic: St001329
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Values
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
Description
The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph.
A graph is outerplanar if and only if in any linear ordering of its vertices, there are no four vertices $a < b < c < d$ such that $(a,c)$ and $(b,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: St001334
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Values
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 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: St001871
(load all 12 compositions to match this statistic)
(load all 12 compositions to match this statistic)
Values
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = -1 + 1
Description
The number of triconnected components of a graph.
A connected graph is '''triconnected''' or '''3-vertex connected''' if it cannot be disconnected by removing two or fewer vertices. An arbitrary connected graph can be decomposed as a union of biconnected (2-vertex connected) graphs, known as '''blocks''', and each biconnected graph can be decomposed as a union of components with are either a cycle (type "S"), a cocyle (type "P"), or triconnected (type "R"). The decomposition of a biconnected graph into these components is known as the '''SPQR-tree''' of the graph.
The following 711 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000387The matching number of a graph. St001070The absolute value of the derivative of the chromatic polynomial of the graph at 1. St001071The beta invariant of the graph. St001286The annihilation number of a graph. St001331The size of the minimal feedback vertex set. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001476The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,-1). St001572The minimal number of edges to remove to make a graph bipartite. St001573The minimal number of edges to remove to make a graph triangle-free. St001638The book thickness of a graph. St001723The differential of a graph. St001724The 2-packing differential of a graph. St000171The degree of the graph. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000272The treewidth of a graph. St000310The minimal degree of a vertex of a graph. St000362The size of a minimal vertex cover of a graph. St000454The largest eigenvalue of a graph if it is integral. St000482The (zero)-forcing number of a graph. St000536The pathwidth of a graph. St000741The Colin de Verdière graph invariant. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000778The metric dimension of a graph. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001119The length of a shortest maximal path in a graph. St001120The length of a longest path in a graph. St001270The bandwidth of a graph. St001277The degeneracy of a graph. St001357The maximal degree of a regular spanning subgraph of a graph. St001358The largest degree of a regular subgraph of a graph. St001391The disjunction number of a graph. St001644The dimension of 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. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001812The biclique partition number of a graph. St001949The rigidity index of a graph. St001962The proper pathwidth of a graph. St000087The number of induced subgraphs. St000093The cardinality of a maximal independent set of vertices of a graph. St000172The Grundy number of a graph. St000286The number of connected components of the complement of a graph. St000363The number of minimal vertex covers of a graph. St000469The distinguishing number of a graph. St000636The hull number of a graph. St000637The length of the longest cycle in a graph. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000722The number of different neighbourhoods in a graph. St000822The Hadwiger number of the graph. St000926The clique-coclique number of a graph. St001108The 2-dynamic chromatic number of a graph. St001110The 3-dynamic chromatic number of a graph. St001112The 3-weak dynamic number of a graph. St001116The game chromatic number of a graph. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001316The domatic number of a graph. St001330The hat guessing number of a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001342The number of vertices in the center of a graph. St001366The maximal multiplicity of a degree of a vertex of a graph. St001368The number of vertices of maximal degree in a graph. St001458The rank of the adjacency matrix of a graph. St001459The number of zero columns in the nullspace of a graph. St001580The acyclic chromatic number of a graph. St001581The achromatic number of a graph. St001645The pebbling number of a connected graph. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St001670The connected partition number of a graph. St001707The length of a longest path in a graph such that the remaining vertices can be partitioned into two sets of the same size without edges between them. St001725The harmonious chromatic number of a graph. St001746The coalition number of a graph. St001796The absolute value of the quotient of the Tutte polynomial of the graph at (1,1) and (-1,-1). St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St001883The mutual visibility number of a graph. St001963The tree-depth of a graph. St000300The number of independent sets of vertices of a graph. St000301The number of facets of the stable set polytope of a graph. St001706The number of closed sets in a graph. St000455The second largest eigenvalue of a graph if it is integral. St000142The number of even parts of a partition. St000322The skewness of a graph. St000323The minimal crossing number of a graph. St000370The genus of a graph. St000547The number of even non-empty partial sums of an integer partition. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. 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. St001092The number of distinct even parts of a partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St000089The absolute variation of a composition. St000149The number of cells of the partition whose leg is zero and arm is odd. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000273The domination number of a graph. St000377The dinv defect of an integer partition. St000544The cop number of a graph. St000697The number of 3-rim hooks removed from an integer partition to obtain its associated 3-core. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000752The Grundy value for the game 'Couples are forever' on an integer partition. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000913The number of ways to refine the partition into singletons. St000934The 2-degree of an integer partition. St000944The 3-degree of an integer partition. St001271The competition number of a 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. 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. St001642The Prague dimension of a graph. St001672The restrained domination number of a graph. St001710The number of permutations such that conjugation with a permutation of given cycle type yields the inverse permutation. St001743The discrepancy of a graph. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001798The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph. St001829The common independence number of a graph. 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. St001917The order of toric promotion on the set of labellings of a graph. St000008The major index of the composition. St000047The number of standard immaculate tableaux of a given shape. St000053The number of valleys of the Dyck path. St000145The Dyson rank of a partition. St000277The number of ribbon shaped standard tableaux. St000299The number of nonisomorphic vertex-induced subtrees. St000306The bounce count of a Dyck path. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000381The largest part of an integer composition. St000382The first part of an integer composition. St000452The number of distinct eigenvalues of a graph. St000453The number of distinct Laplacian eigenvalues of a graph. St000478Another weight of a partition according to Alladi. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St000632The jump number of the poset. St000681The Grundy value of Chomp on Ferrers diagrams. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000808The number of up steps of the associated bargraph. St000939The number of characters of the symmetric group whose value on the partition is positive. St001093The detour number of a graph. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. 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. St001323The independence gap of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001345The Hamming dimension of a graph. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. 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. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. 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. St001674The number of vertices of the largest induced star graph in the graph. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St001716The 1-improper chromatic number of a graph. St001742The difference of the maximal and the minimal degree in a graph. St001777The number of weak descents in an integer composition. St001792The arboricity of a graph. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St000010The length of the partition. St000011The number of touch points (or returns) of a Dyck path. St000015The number of peaks of a Dyck path. St000068The number of minimal elements in a poset. St000069The number of maximal elements of a poset. St000071The number of maximal chains in a poset. St000147The largest part of an integer partition. St000181The number of connected components of the Hasse diagram for the poset. St000184The size of the centralizer of any permutation of given cycle type. St000189The number of elements in the poset. St000228The size of a partition. St000258The burning number of a graph. St000271The chromatic index of a graph. St000287The number of connected components of a graph. St000288The number of ones in a binary word. St000309The number of vertices with even degree. St000315The number of isolated vertices of a graph. St000384The maximal part of the shifted composition of an integer partition. St000459The hook length of the base cell of a partition. St000460The hook length of the last cell along the main diagonal of an integer partition. St000474Dyson's crank of a partition. St000477The weight of a partition according to Alladi. St000479The Ramsey number of a graph. St000527The width of the poset. St000531The leading coefficient of the rook polynomial of an integer partition. St000553The number of blocks of a graph. St000639The number of relations in a poset. St000641The number of non-empty boolean intervals in a poset. St000667The greatest common divisor of the parts of the partition. St000668The least common multiple of the parts of the partition. St000708The product of the parts of an integer partition. St000734The last entry in the first row of a standard tableau. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000765The number of weak records in an integer composition. St000770The major index of an integer partition when read from bottom to top. St000775The multiplicity of the largest eigenvalue in a graph. St000784The maximum of the length and the largest part of the integer partition. St000820The number of compositions obtained by rotating the composition. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000899The maximal number of repetitions of an integer composition. St000900The minimal number of repetitions of a part in an integer composition. St000902 The minimal number of repetitions of an integer composition. St000904The maximal number of repetitions of an integer composition. St000908The length of the shortest maximal antichain in a poset. St000909The number of maximal chains of maximal size in a poset. St000910The number of maximal chains of minimal length in a poset. St000914The sum of the values of the Möbius function of a poset. St000916The packing number of a graph. St000917The open packing number of a graph. St000918The 2-limited packing number of a graph. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. St000992The alternating sum of the parts of an integer partition. St001055The Grundy value for the game of removing cells of a row in an integer partition. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001102The number of words with multiplicities of the letters given by the composition, avoiding the consecutive pattern 132. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001203We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n-1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a Dyck path as follows:
St001235The global dimension of the corresponding Comp-Nakayama algebra. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001268The size of the largest ordinal summand in the poset. St001279The sum of the parts of an integer partition that are at least two. St001312Number of parabolic noncrossing partitions indexed by the composition. St001315The dissociation number of a graph. St001360The number of covering relations in Young's lattice below a partition. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001389The number of partitions of the same length below the given integer partition. St001399The distinguishing number of a poset. St001441The number of non-empty connected induced subgraphs of a graph. St001463The number of distinct columns in the nullspace of a graph. St001527The cyclic permutation representation number of an integer partition. St001570The minimal number of edges to add to make a graph Hamiltonian. St001571The Cartan determinant of the integer partition. St001574The minimal number of edges to add or remove to make a graph regular. St001576The minimal number of edges to add or remove to make a graph vertex transitive. St001635The trace of the square of the Coxeter matrix of the incidence algebra of a poset. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St001659The number of ways to place as many non-attacking rooks as possible on a Ferrers board. St001675The number of parts equal to the part in the reversed composition. St001691The number of kings in a graph. St001692The number of vertices with higher degree than the average degree in a graph. St001708The number of pairs of vertices of different degree in a graph. St001779The order of promotion on the set of linear extensions of a poset. St001828The Euler characteristic of a graph. St000063The number of linear extensions of a certain poset defined for an integer partition. St000108The number of partitions contained in the given partition. St000180The number of chains of a poset. St000349The number of different adjacency matrices of a graph. St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. St000532The total number of rook placements on a Ferrers board. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000806The semiperimeter of the associated bargraph. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001400The total number of Littlewood-Richardson tableaux of given shape. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St001664The number of non-isomorphic subposets of a poset. St001814The number of partitions interlacing the given partition. St001834The number of non-isomorphic minors of a graph. St000656The number of cuts of a poset. St001117The game chromatic index of a graph. St001383The BG-rank of an integer partition. St000143The largest repeated part of a partition. St000150The floored half-sum of the multiplicities of a partition. St000212The number of standard Young tableaux for an integer partition such that no two consecutive entries appear in the same row. St000256The number of parts from which one can substract 2 and still get an integer partition. St000257The number of distinct parts of a partition that occur at least twice. St000274The number of perfect matchings of a graph. St000369The dinv deficit of a Dyck path. St000481The number of upper covers of a partition in dominance order. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000535The rank-width of a graph. St000537The cutwidth of a graph. St000618The number of self-evacuating tableaux of given shape. St000660The number of rises of length at least 3 of a Dyck path. St000661The number of rises of length 3 of a Dyck path. St000811The sum of the entries in the column specified by the partition of the change of basis matrix from powersum symmetric functions to Schur symmetric functions. St000877The depth of the binary word interpreted as a path. St000921The number of internal inversions of a binary word. St000929The constant term of the character polynomial of an integer partition. St000931The number of occurrences of the pattern UUU in a Dyck path. St001025Number of simple modules with projective dimension 4 in the Nakayama algebra corresponding to the Dyck path. St001027Number of simple modules with projective dimension equal to injective dimension in the Nakayama algebra corresponding to the Dyck path. St001033The normalized area of the parallelogram polyomino associated with the Dyck path. St001057The Grundy value of the game of creating an independent set in a graph. St001091The number of parts in an integer partition whose next smaller part has the same size. St001104The number of descents of the invariant in a tensor power of the adjoint representation of the rank two general linear group. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001141The number of occurrences of hills of size 3 in a Dyck path. St001175The size of a partition minus the hook length of the base cell. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. 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. St001307The number of induced stars on four vertices in a graph. St001320The minimal number of occurrences of the path-pattern in a linear ordering of the vertices of the graph. St001349The number of different graphs obtained from the given graph by removing an edge. St001371The length of the longest Yamanouchi prefix of a binary word. St001424The number of distinct squares in a binary word. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001561The value of the elementary symmetric function evaluated at 1. St001578The minimal number of edges to add or remove to make a graph a line graph. St001587Half of the largest even part of an integer partition. St001592The maximal number of simple paths between any two different vertices of a graph. St001600The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple graphs. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St001649The length of a longest trail in a graph. St001721The degree of a binary word. St001730The number of times the path corresponding to a binary word crosses the base line. St001826The maximal number of leaves on a vertex of a graph. St001931The weak major index of an integer composition regarded as a word. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St000003The number of standard Young tableaux of the partition. St000024The number of double up and double down steps of a Dyck path. St000079The number of alternating sign matrices for a given Dyck path. St000088The row sums of the character table of the symmetric group. St000090The variation of a composition. St000091The descent variation of a composition. St000120The number of left tunnels of a Dyck path. St000137The Grundy value of an integer partition. St000146The Andrews-Garvan crank of a partition. St000148The number of odd parts of a partition. St000160The multiplicity of the smallest part of a partition. St000183The side length of the Durfee square of an integer partition. St000185The weighted size of a partition. St000225Difference between largest and smallest parts in a partition. St000293The number of inversions of a binary word. St000326The position of the first one in a binary word after appending a 1 at the end. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000346The number of coarsenings of a partition. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000442The maximal area to the right of an up step of a Dyck path. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000513The number of invariant subsets of size 2 when acting with a permutation of given cycle type. St000517The Kreweras number of an integer partition. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000548The number of different non-empty partial sums of an integer partition. St000549The number of odd partial sums of an integer partition. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000682The Grundy value of Welter's game on a binary word. St000699The toughness times the least common multiple of 1,. St000706The product of the factorials of the multiplicities of 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. St000759The smallest missing part in an integer partition. St000766The number of inversions of an integer composition. St000783The side length of the largest staircase partition fitting into a partition. St000816The number of standard composition tableaux of the composition. St000874The position of the last double rise in a Dyck path. St000885The number of critical steps in the Catalan decomposition of a binary word. St000905The number of different multiplicities of parts of an integer composition. St000920The logarithmic height of a Dyck path. St000937The number of positive values of the symmetric group character corresponding to the partition. St000938The number of zeros of the symmetric group character corresponding to the partition. 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}$. St000982The length of the longest constant subword. St000993The multiplicity of the largest part of an integer partition. St000997The even-odd crank of an integer partition. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001010Number of indecomposable injective modules with projective dimension g-1 when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension in the Nakayama algebra corresponding to the Dyck path. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001032The number of horizontal steps in the bicoloured Motzkin path associated with the Dyck path. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. 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. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001126Number of simple module that are 1-regular in the corresponding Nakayama algebra. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001167The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra. St001176The size of a partition minus its first part. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001214The aft of an integer partition. 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. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001251The number of parts of a partition that are not congruent 1 modulo 3. St001252Half the sum of the even parts of a partition. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001280The number of parts of an integer partition that are at least two. St001281The normalized isoperimetric number of a graph. St001282The number of graphs with the same chromatic polynomial. 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. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001365The number of lattice paths of the same length weakly above the path given by a binary word. St001385The number of conjugacy classes of subgroups with connected subgroups of sizes prescribed by an integer partition. St001413Half the length of the longest even length palindromic prefix of a binary word. St001432The order dimension of the partition. 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. St001438The number of missing boxes of a skew partition. St001480The number of simple summands of the module J^2/J^3. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001518The number of graphs with the same ordinary spectrum as the given graph. St001524The degree of symmetry of a binary word. St001525The number of symmetric hooks on the diagonal of a partition. St001568The smallest positive integer that does not appear twice in the partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. 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. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001657The number of twos in an integer partition. St001660The number of ways to place as many non-attacking rooks as possible on a skew Ferrers board. St001740The number of graphs with the same symmetric edge polytope as the given graph. St001780The order of promotion on the set of standard tableaux of given shape. 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). St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. 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. St001939The number of parts that are equal to their multiplicity in the integer partition. St001955The number of natural descents for set-valued two row standard Young tableaux. St001961The sum of the greatest common divisors of all pairs of parts. St000005The bounce statistic of a Dyck path. St000013The height of a Dyck path. St000025The number of initial rises of a Dyck path. St000026The position of the first return of a Dyck path. St000081The number of edges of a graph. St000157The number of descents of a standard tableau. St000182The number of permutations whose cycle type is the given integer partition. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000295The length of the border of a binary word. St000312The number of leaves in a graph. St000321The number of integer partitions of n that are dominated by an integer partition. St000331The number of upper interactions of a Dyck path. St000335The difference of lower and upper interactions. St000345The number of refinements of a partition. St000378The diagonal inversion number of an integer partition. St000383The last part of an integer composition. St000393The number of strictly increasing runs in a binary word. St000419The number of Dyck paths that are weakly above the Dyck path, except for the path itself. St000443The number of long tunnels of a Dyck path. St000444The length of the maximal rise of a Dyck path. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000519The largest length of a factor maximising the subword complexity. St000567The sum of the products of all pairs of parts. St000626The minimal period of a binary word. St000631The number of distinct palindromic decompositions of a binary word. St000644The number of graphs with given frequency partition. St000645The sum of the areas of the rectangles formed by two consecutive peaks and the valley in between. St000676The number of odd rises of a Dyck path. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000743The number of entries in a standard Young tableau such that the next integer is a neighbour. St000744The length of the path to the largest entry in a standard Young tableau. St000810The sum of the entries in the column specified by the partition of the change of basis matrix from powersum symmetric functions to monomial symmetric functions. St000814The sum of the entries in the column specified by the partition of the change of basis matrix from elementary symmetric functions to Schur symmetric functions. St000876The number of factors in the Catalan decomposition of a binary word. St000932The number of occurrences of the pattern UDU in a Dyck path. St000933The number of multipartitions of sizes given by an integer partition. St000935The number of ordered refinements of an integer partition. St000947The major index east count of a Dyck path. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. 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. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001060The distinguishing index of a graph. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001118The acyclic chromatic index of a graph. St001128The exponens consonantiae of a partition. St001161The major index north count of a Dyck path. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001297The number of indecomposable non-injective projective modules minus the number of indecomposable non-injective projective modules that have reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001313The number of Dyck paths above the lattice path given by a binary word. St001386The number of prime labellings of a graph. St001437The flex of a binary word. St001471The magnitude of a Dyck path. St001479The number of bridges of a graph. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001498The normalised height of a Nakayama algebra with magnitude 1. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001595The number of standard Young tableaux of the skew partition. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001809The index of the step at the first peak of maximal height in a Dyck path. St001827The number of two-component spanning forests of a graph. St001869The maximum cut size of a graph. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001959The product of the heights of the peaks of a Dyck path. St000014The number of parking functions supported by a Dyck path. St000048The multinomial of the parts of a partition. St000049The number of set partitions whose sorted block sizes correspond to the partition. St000086The number of subgraphs. St000144The pyramid weight of the Dyck path. St000296The length of the symmetric border of a binary word. St000297The number of leading ones in a binary word. St000392The length of the longest run of ones in a binary word. St000395The sum of the heights of the peaks of a Dyck path. St000420The number of Dyck paths that are weakly above a Dyck path. St000439The position of the first down step of a Dyck path. St000445The number of rises of length 1 of a Dyck path. St000468The Hosoya index of a graph. St000475The number of parts equal to 1 in a partition. St000507The number of ascents of a standard tableau. St000543The size of the conjugacy class of a binary word. St000617The number of global maxima of a Dyck path. St000627The exponent of a binary word. St000657The smallest part of an integer composition. St000674The number of hills of a Dyck path. St000678The number of up steps after the last double rise of a Dyck path. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000733The row containing the largest entry of a standard tableau. St000763The sum of the positions of the strong records of an integer composition. St000815The number of semistandard Young tableaux of partition weight of given shape. St000867The sum of the hook lengths in the first row of an integer partition. St000878The number of ones minus the number of zeros of a binary word. St000915The Ore degree of a graph. St000922The minimal number such that all substrings of this length are unique. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000946The sum of the skew hook positions in a Dyck path. St001002Number of indecomposable modules with projective and injective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001018Sum of projective dimension of the indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001020Sum of the codominant dimensions of the non-projective indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001034The area of the parallelogram polyomino associated with the Dyck path. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001127The sum of the squares of the parts of a partition. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001170Number of indecomposable injective modules whose socle has projective dimension at most g-1 when g denotes the global dimension in the corresponding Nakayama algebra. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001179Number of indecomposable injective modules with projective dimension at most 2 in the corresponding Nakayama algebra. St001180Number of indecomposable injective modules with projective dimension at most 1. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001211The number of simple modules in the corresponding Nakayama algebra that have vanishing second Ext-group with the regular module. 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. St001228The vector space dimension of the space of module homomorphisms between J and itself when J denotes the Jacobson radical of the corresponding Nakayama algebra. St001237The number of simple modules with injective dimension at most one or dominant dimension at least one. St001249Sum of the odd parts of a partition. St001254The vector space dimension of the first extension-group between A/soc(A) and J when A is the corresponding Nakayama algebra with Jacobson radical J. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001267The length of the Lyndon factorization of the binary word. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001348The bounce of the parallelogram polyomino associated with the Dyck path. St001372The length of a longest cyclic run of ones of a binary word. St001387Number of standard Young tableaux of the skew shape tracing the border of the given partition. St001415The length of the longest palindromic prefix of a binary word. St001416The length of a longest palindromic factor of a binary word. St001417The length of a longest palindromic subword of a binary word. St001419The length of the longest palindromic factor beginning with a one of a binary word. St001462The number of factors of a standard tableaux under concatenation. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. 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. St001504The sum of all indegrees of vertices with indegree at least two in the resolution quiver of a Nakayama algebra corresponding to the Dyck path. St001523The degree of symmetry of a Dyck path. St001530The depth of a Dyck path. St001541The Gini index of an integer partition. St001614The cyclic permutation representation number of a skew partition. St001688The sum of the squares of the heights of the peaks of a Dyck path. St001733The number of weak left to right maxima of a Dyck path. St001800The number of 3-Catalan paths having this Dyck path as first and last coordinate projections. St001808The box weight or horizontal decoration of a Dyck path. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001884The number of borders of a binary word. St001957The number of Hasse diagrams with a given underlying undirected graph. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000294The number of distinct factors of a binary word. St000391The sum of the positions of the ones in a binary word. St000518The number of distinct subsequences in a binary word. St000529The number of permutations whose descent word is the given binary word. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000949Gives the number of generalised tilting modules of the corresponding LNakayama algebra. St000969We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n-1}]$ by adding $c_0$ to $c_{n-1}$. St000998Number of indecomposable projective modules with injective dimension smaller than or equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St001019Sum of the projective dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001023Number of simple modules with projective dimension at most 3 in the Nakayama algebra corresponding to the Dyck path. St001065Number of indecomposable reflexive modules in the corresponding Nakayama algebra. St001166Number of indecomposable projective non-injective modules with dominant dimension equal to the global dimension plus the number of indecomposable projective injective modules in the corresponding Nakayama algebra. St001182Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra. St001190Number of simple modules with projective dimension at most 4 in the corresponding Nakayama algebra. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001643The Frobenius dimension of the Nakayama algebra corresponding to the Dyck path. St001650The order of Ringel's homological bijection associated to the linear Nakayama algebra corresponding to the Dyck path. St001658The total number of rook placements on a Ferrers board. St000967The value p(1) for the Coxeterpolynomial p of the corresponding LNakayama algebra. St001003The number of indecomposable modules with projective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001213The number of indecomposable modules in the corresponding Nakayama algebra that have vanishing first Ext-group with the regular module. St001218Smallest index k greater than or equal to one such that the Coxeter matrix C of the corresponding Nakayama algebra has C^k=1. St001838The number of nonempty primitive factors of a binary word. St001138The number of indecomposable modules with projective dimension or injective dimension at most one in the corresponding Nakayama algebra. St001262The dimension of the maximal parabolic seaweed algebra corresponding to the partition. St000826The stopping time of the decimal representation of the binary word for the 3x+1 problem. 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$. St001615The number of join prime elements of a lattice. St001703The villainy of a graph. St001846The number of elements which do not have a complement in the lattice. St001613The binary logarithm of the size of the center of a lattice. St001617The dimension of the space of valuations of a lattice. St001651The Frankl number of a lattice. 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. St001845The number of join irreducibles minus the rank of a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices. St001616The number of neutral elements in a lattice. St001618The cardinality of the Frattini sublattice of a lattice. St001624The breadth of a lattice. St001625The Möbius invariant of a lattice. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001720The minimal length of a chain of small intervals in a lattice. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001754The number of tolerances of a finite lattice. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001621The number of atoms of a lattice. St001622The number of join-irreducible elements of a lattice. St001623The number of doubly irreducible elements of a lattice. St001626The number of maximal proper sublattices of a lattice. St001677The number of non-degenerate subsets of a lattice whose meet is the bottom element. St001681The number of inclusion-wise minimal subsets of a lattice, whose meet is the bottom element. St001875The number of simple modules with projective dimension at most 1. St001877Number of indecomposable injective modules with projective dimension 2. St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St001545The second Elser number of a connected graph. St001619The number of non-isomorphic sublattices of a lattice. St001666The number of non-isomorphic subposets of a lattice which are lattices. St001833The number of linear intervals in a lattice. St001620The number of sublattices of a lattice. St001679The number of subsets of a lattice whose meet is the bottom element. St001529The number of monomials in the expansion of the nabla operator applied to the power-sum symmetric function indexed by the partition. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St000264The girth of a graph, which is not a tree. St000283The size of the preimage of the map 'to graph' from Binary trees to Graphs. St001793The difference between the clique number and the chromatic number of a graph. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001256Number of simple reflexive modules that are 2-stable reflexive. 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. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001006Number of simple modules with projective dimension equal to the global dimension of 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. St000738The first entry in the last row of a standard tableau. St000276The size of the preimage of the map 'to graph' from Ordered trees to Graphs. St000422The energy of a graph, if it is integral. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001367The smallest number which does not occur as degree of a vertex in a graph. St001333The cardinality of a minimal edge-isolating set of a graph. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001722The number of minimal chains with small intervals between a binary word and the top element. 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. 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. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. 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. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St001473The absolute value of the sum of all entries of the Coxeter matrix of the corresponding LNakayama algebra. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001275The projective dimension of the second term in a minimal injective coresolution of the regular module. St001481The minimal height of a peak of a Dyck path. St001872The number of indecomposable injective modules with even projective dimension in the corresponding Nakayama algebra. St000953The largest degree of an irreducible factor of the Coxeter polynomial of the Dyck path over the rational numbers. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2.
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!