searching the database
Your data matches 557 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: St001029
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> 1
([],3)
=> ([],3)
=> 1
([],4)
=> ([],4)
=> 1
([],5)
=> ([],5)
=> 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([],6)
=> ([],6)
=> 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,5),(1,3),(1,4),(2,5),(3,5),(4,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,4),(0,5),(1,4),(1,5),(2,3),(4,2),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,4),(0,5),(1,3),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,2),(0,3),(0,4),(1,5),(3,5),(4,1)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,3),(0,4),(2,5),(3,2),(4,1),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,2),(0,3),(1,4),(2,4),(2,5),(3,1),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(1,3),(1,4),(2,5),(3,5),(4,2)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> 5
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,4),(1,2),(1,3),(2,5),(3,4),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,3),(0,4),(2,5),(3,5),(4,1),(4,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,5),(5,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,2),(0,5),(1,4),(1,5),(2,4),(4,3),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,3),(2,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,2),(0,5),(1,4),(1,5),(2,3),(2,4),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,4),(0,5),(1,2),(1,3),(1,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,4),(0,5),(1,2),(1,3),(1,4),(2,5),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,2),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,3),(0,4),(1,2),(1,4),(1,5),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,2),(0,3),(1,4),(1,5),(2,4),(2,5),(3,1)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,2),(0,4),(2,5),(3,1),(3,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,3),(1,2),(1,4),(2,5),(3,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,4),(0,5),(1,2),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,4),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,4),(1,2),(1,4),(2,5),(3,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,4),(1,3),(1,5),(2,3),(2,4),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
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: St001304
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> 1
([],3)
=> ([],3)
=> 1
([],4)
=> ([],4)
=> 1
([],5)
=> ([],5)
=> 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([],6)
=> ([],6)
=> 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,5),(1,3),(1,4),(2,5),(3,5),(4,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,4),(0,5),(1,4),(1,5),(2,3),(4,2),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,4),(0,5),(1,3),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,2),(0,3),(0,4),(1,5),(3,5),(4,1)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,3),(0,4),(2,5),(3,2),(4,1),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,2),(0,3),(1,4),(2,4),(2,5),(3,1),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(1,3),(1,4),(2,5),(3,5),(4,2)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> 5
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,4),(1,2),(1,3),(2,5),(3,4),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,3),(0,4),(2,5),(3,5),(4,1),(4,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,5),(5,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,2),(0,5),(1,4),(1,5),(2,4),(4,3),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,3),(2,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,2),(0,5),(1,4),(1,5),(2,3),(2,4),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,4),(0,5),(1,2),(1,3),(1,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,4),(0,5),(1,2),(1,3),(1,4),(2,5),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,2),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,3),(0,4),(1,2),(1,4),(1,5),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,2),(0,3),(1,4),(1,5),(2,4),(2,5),(3,1)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
([(0,2),(0,4),(2,5),(3,1),(3,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,3),(1,2),(1,4),(2,5),(3,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,4),(0,5),(1,2),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,4),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,4),(1,2),(1,4),(2,5),(3,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,4),(1,3),(1,5),(2,3),(2,4),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> 5
Description
The number of maximally independent sets of vertices of a graph.
An '''independent set''' of vertices of a graph is a set of vertices no two of which are adjacent. If a set of vertices is independent then so is every subset. This statistic counts the number of maximally independent sets of vertices.
Matching statistic: St000068
Values
([],1)
=> ([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> ([],1)
=> 1
([],3)
=> ([],3)
=> ([],1)
=> 1
([],4)
=> ([],4)
=> ([],1)
=> 1
([],5)
=> ([],5)
=> ([],1)
=> 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([],5)
=> 5
([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([],5)
=> 5
([],6)
=> ([],6)
=> ([],1)
=> 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,5),(1,3),(1,4),(2,5),(3,5),(4,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,4),(0,5),(1,4),(1,5),(2,3),(4,2),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,4),(0,5),(1,3),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,2),(0,3),(0,4),(1,5),(3,5),(4,1)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,3),(0,4),(2,5),(3,2),(4,1),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,2),(0,3),(1,4),(2,4),(2,5),(3,1),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(1,3),(1,4),(2,5),(3,5),(4,2)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 5
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(1,2),(1,3),(2,5),(3,4),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,3),(0,4),(2,5),(3,5),(4,1),(4,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,5),(5,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,2),(0,5),(1,4),(1,5),(2,4),(4,3),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,3),(2,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,2),(0,5),(1,4),(1,5),(2,3),(2,4),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,4),(0,5),(1,2),(1,3),(1,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(0,5),(1,2),(1,3),(1,4),(2,5),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,2),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,3),(0,4),(1,2),(1,4),(1,5),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,2),(0,3),(1,4),(1,5),(2,4),(2,5),(3,1)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,2),(0,4),(2,5),(3,1),(3,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,3),(1,2),(1,4),(2,5),(3,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(0,5),(1,2),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(1,2),(1,4),(2,5),(3,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(1,3),(1,5),(2,3),(2,4),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
Description
The number of minimal elements in a poset.
Matching statistic: St000071
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> ([],1)
=> 1
([],3)
=> ([],3)
=> ([],1)
=> 1
([],4)
=> ([],4)
=> ([],1)
=> 1
([],5)
=> ([],5)
=> ([],1)
=> 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([],5)
=> 5
([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([],5)
=> 5
([],6)
=> ([],6)
=> ([],1)
=> 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,5),(1,3),(1,4),(2,5),(3,5),(4,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,4),(0,5),(1,4),(1,5),(2,3),(4,2),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,4),(0,5),(1,3),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,2),(0,3),(0,4),(1,5),(3,5),(4,1)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,3),(0,4),(2,5),(3,2),(4,1),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,2),(0,3),(1,4),(2,4),(2,5),(3,1),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(1,3),(1,4),(2,5),(3,5),(4,2)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 5
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(1,2),(1,3),(2,5),(3,4),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,3),(0,4),(2,5),(3,5),(4,1),(4,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,5),(5,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,2),(0,5),(1,4),(1,5),(2,4),(4,3),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,3),(2,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,2),(0,5),(1,4),(1,5),(2,3),(2,4),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,4),(0,5),(1,2),(1,3),(1,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(0,5),(1,2),(1,3),(1,4),(2,5),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,2),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,3),(0,4),(1,2),(1,4),(1,5),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,2),(0,3),(1,4),(1,5),(2,4),(2,5),(3,1)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,2),(0,4),(2,5),(3,1),(3,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,3),(1,2),(1,4),(2,5),(3,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(0,5),(1,2),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(1,2),(1,4),(2,5),(3,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(1,3),(1,5),(2,3),(2,4),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
Description
The number of maximal chains in a poset.
Matching statistic: St000096
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> ([],1)
=> 1
([],3)
=> ([],3)
=> ([],1)
=> 1
([],4)
=> ([],4)
=> ([],1)
=> 1
([],5)
=> ([],5)
=> ([],1)
=> 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([],6)
=> ([],6)
=> ([],1)
=> 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,5),(1,3),(1,4),(2,5),(3,5),(4,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,4),(1,5),(2,3),(4,2),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,3),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,3),(0,4),(1,5),(3,5),(4,1)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(2,5),(3,2),(4,1),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,3),(1,4),(2,4),(2,5),(3,1),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(1,3),(1,4),(2,5),(3,5),(4,2)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,2),(1,3),(2,5),(3,4),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(2,5),(3,5),(4,1),(4,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,5),(5,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,5),(1,4),(1,5),(2,4),(4,3),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,3),(2,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,5),(1,4),(1,5),(2,3),(2,4),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,3),(1,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,3),(1,4),(2,5),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(1,2),(1,4),(1,5),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,3),(1,4),(1,5),(2,4),(2,5),(3,1)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,4),(2,5),(3,1),(3,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(1,2),(1,4),(2,5),(3,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,2),(1,4),(2,5),(3,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,3),(1,5),(2,3),(2,4),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
Description
The number of spanning trees of a graph.
A subgraph $H \subseteq G$ is a spanning tree if $V(H)=V(G)$ and $H$ is a tree (i.e. $H$ is connected and contains no cycles).
Matching statistic: St000267
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> ([],1)
=> 1
([],3)
=> ([],3)
=> ([],1)
=> 1
([],4)
=> ([],4)
=> ([],1)
=> 1
([],5)
=> ([],5)
=> ([],1)
=> 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([],6)
=> ([],6)
=> ([],1)
=> 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,5),(1,3),(1,4),(2,5),(3,5),(4,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,4),(1,5),(2,3),(4,2),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,3),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,3),(0,4),(1,5),(3,5),(4,1)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(2,5),(3,2),(4,1),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,3),(1,4),(2,4),(2,5),(3,1),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(1,3),(1,4),(2,5),(3,5),(4,2)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,2),(1,3),(2,5),(3,4),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(2,5),(3,5),(4,1),(4,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,5),(5,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,5),(1,4),(1,5),(2,4),(4,3),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,3),(2,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,5),(1,4),(1,5),(2,3),(2,4),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,3),(1,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,3),(1,4),(2,5),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(1,2),(1,4),(1,5),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,3),(1,4),(1,5),(2,4),(2,5),(3,1)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,4),(2,5),(3,1),(3,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(1,2),(1,4),(2,5),(3,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,2),(1,4),(2,5),(3,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,3),(1,5),(2,3),(2,4),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
Description
The number of maximal spanning forests contained in a graph.
A maximal spanning forest in a graph is a maximal acyclic subgraph. In other words, a spanning forest is a union of spanning trees in all connected components. See also [1] for this and further definitions.
For connected graphs, this is the same as [[St000096]].
Matching statistic: St000309
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> ([],1)
=> 1
([],3)
=> ([],3)
=> ([],1)
=> 1
([],4)
=> ([],4)
=> ([],1)
=> 1
([],5)
=> ([],5)
=> ([],1)
=> 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([],6)
=> ([],6)
=> ([],1)
=> 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,5),(1,3),(1,4),(2,5),(3,5),(4,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,4),(1,5),(2,3),(4,2),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,3),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,3),(0,4),(1,5),(3,5),(4,1)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(2,5),(3,2),(4,1),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,3),(1,4),(2,4),(2,5),(3,1),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(1,3),(1,4),(2,5),(3,5),(4,2)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,2),(1,3),(2,5),(3,4),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(2,5),(3,5),(4,1),(4,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,5),(5,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,5),(1,4),(1,5),(2,4),(4,3),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,3),(2,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,5),(1,4),(1,5),(2,3),(2,4),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,3),(1,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,3),(1,4),(2,5),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(1,2),(1,4),(1,5),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,3),(1,4),(1,5),(2,4),(2,5),(3,1)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,4),(2,5),(3,1),(3,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(1,2),(1,4),(2,5),(3,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,2),(1,4),(2,5),(3,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,3),(1,5),(2,3),(2,4),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
Description
The number of vertices with even degree.
Matching statistic: St000363
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> ([],1)
=> 1
([],3)
=> ([],3)
=> ([],1)
=> 1
([],4)
=> ([],4)
=> ([],1)
=> 1
([],5)
=> ([],5)
=> ([],1)
=> 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([],6)
=> ([],6)
=> ([],1)
=> 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,5),(1,3),(1,4),(2,5),(3,5),(4,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,4),(1,5),(2,3),(4,2),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,3),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,3),(0,4),(1,5),(3,5),(4,1)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(2,5),(3,2),(4,1),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,3),(1,4),(2,4),(2,5),(3,1),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(1,3),(1,4),(2,5),(3,5),(4,2)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,2),(1,3),(2,5),(3,4),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(2,5),(3,5),(4,1),(4,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,5),(5,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,5),(1,4),(1,5),(2,4),(4,3),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,3),(2,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,5),(1,4),(1,5),(2,3),(2,4),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,3),(1,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,3),(1,4),(2,5),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(1,2),(1,4),(1,5),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,3),(1,4),(1,5),(2,4),(2,5),(3,1)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,4),(2,5),(3,1),(3,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(1,2),(1,4),(2,5),(3,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,2),(1,4),(2,5),(3,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,3),(1,5),(2,3),(2,4),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
Description
The number of minimal vertex covers of a graph.
A '''vertex cover''' of a graph $G$ is a subset $S$ of the vertices of $G$ such that each edge of $G$ contains at least one vertex of $S$. A vertex cover is minimal if it contains the least possible number of vertices.
This is also the leading coefficient of the clique polynomial of the complement of $G$.
This is also the number of independent sets of maximal cardinality of $G$.
Matching statistic: St000527
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> ([],1)
=> 1
([],3)
=> ([],3)
=> ([],1)
=> 1
([],4)
=> ([],4)
=> ([],1)
=> 1
([],5)
=> ([],5)
=> ([],1)
=> 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([],5)
=> 5
([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([],5)
=> 5
([],6)
=> ([],6)
=> ([],1)
=> 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,5),(1,3),(1,4),(2,5),(3,5),(4,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,4),(0,5),(1,4),(1,5),(2,3),(4,2),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,4),(0,5),(1,3),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,2),(0,3),(0,4),(1,5),(3,5),(4,1)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,3),(0,4),(2,5),(3,2),(4,1),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,2),(0,3),(1,4),(2,4),(2,5),(3,1),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(1,3),(1,4),(2,5),(3,5),(4,2)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 5
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(1,2),(1,3),(2,5),(3,4),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,3),(0,4),(2,5),(3,5),(4,1),(4,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,5),(5,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,2),(0,5),(1,4),(1,5),(2,4),(4,3),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,3),(2,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,2),(0,5),(1,4),(1,5),(2,3),(2,4),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,4),(0,5),(1,2),(1,3),(1,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(0,5),(1,2),(1,3),(1,4),(2,5),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,2),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,3),(0,4),(1,2),(1,4),(1,5),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,2),(0,3),(1,4),(1,5),(2,4),(2,5),(3,1)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([],5)
=> 5
([(0,2),(0,4),(2,5),(3,1),(3,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,3),(1,2),(1,4),(2,5),(3,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(0,5),(1,2),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(1,2),(1,4),(2,5),(3,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(1,3),(1,5),(2,3),(2,4),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(3,5),(4,5)],6)
=> 5
Description
The width of the poset.
This is the size of the poset's longest antichain, also called Dilworth number.
Matching statistic: St000722
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> ([],1)
=> 1
([],3)
=> ([],3)
=> ([],1)
=> 1
([],4)
=> ([],4)
=> ([],1)
=> 1
([],5)
=> ([],5)
=> ([],1)
=> 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([],6)
=> ([],6)
=> ([],1)
=> 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,5),(1,3),(1,4),(2,5),(3,5),(4,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,4),(1,5),(2,3),(4,2),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,3),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,3),(0,4),(1,5),(3,5),(4,1)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(2,5),(3,2),(4,1),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,3),(1,4),(2,4),(2,5),(3,1),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(1,3),(1,4),(2,5),(3,5),(4,2)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,2),(1,3),(2,5),(3,4),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(2,5),(3,5),(4,1),(4,2)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,5),(5,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,5),(1,4),(1,5),(2,4),(4,3),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,4),(2,3),(2,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,5),(1,4),(1,5),(2,3),(2,4),(5,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,3),(1,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(1,3),(1,4),(2,5),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(0,4),(1,2),(1,4),(1,5),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,3),(1,4),(1,5),(2,4),(2,5),(3,1)],6)
=> ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,2),(0,4),(2,5),(3,1),(3,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,3),(1,2),(1,4),(2,5),(3,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(0,5),(1,2),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,2),(1,4),(2,5),(3,5),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,3),(1,5),(2,3),(2,4),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
Description
The number of different neighbourhoods in a graph.
The following 547 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001108The 2-dynamic chromatic number of a graph. St001110The 3-dynamic chromatic number of a graph. St001302The number of minimally dominating sets of vertices of a graph. St001342The number of vertices in the center of a graph. St001356The number of vertices in prime modules 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. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001546The number of monomials in the Tutte polynomial of a graph. St001645The pebbling number of a connected graph. St001694The number of maximal dissociation sets in 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. St000368The Altshuler-Steinberg determinant of a graph. St000632The jump number of the poset. St000915The Ore degree 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. St001319The minimal number of occurrences of the star-pattern in a linear ordering of the vertices of the graph. St001345The Hamming dimension of a graph. St001869The maximum cut size of a graph. St000010The length of the partition. St000069The number of maximal elements of a poset. St000147The largest part of an integer partition. St000171The degree of the graph. St000184The size of the centralizer of any permutation of given cycle type. St000228The size of a partition. St000271The chromatic index of a graph. St000274The number of perfect matchings of a graph. St000384The maximal part of the shifted composition of an integer partition. St000452The number of distinct eigenvalues of a graph. St000453The number of distinct Laplacian eigenvalues of a graph. 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. St000531The leading coefficient of the rook polynomial of an integer partition. St000537The cutwidth of a graph. St000667The greatest common divisor of the parts of the partition. St000784The maximum of the length and the largest part of the integer partition. 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. 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. St001118The acyclic chromatic index of a graph. St001249Sum of the odd parts of a partition. St001360The number of covering relations in Young's lattice below a partition. St001389The number of partitions of the same length below the given integer partition. St001391The disjunction number of a graph. St001395The number of strictly unfriendly partitions of a graph. St001486The number of corners of the ribbon associated with an integer composition. St001527The cyclic permutation representation number of an integer partition. St001571The Cartan determinant of the integer partition. St001659The number of ways to place as many non-attacking rooks as possible on a Ferrers board. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001783The number of odd automorphisms 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. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St000008The major index of the composition. St000063The number of linear extensions of a certain poset defined for an integer partition. St000108The number of partitions contained in the given partition. St000145The Dyson rank of a partition. St000185The weighted size of a partition. St000311The number of vertices of odd degree in a graph. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. 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. St000637The length of the longest cycle in a graph. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000926The clique-coclique number of a graph. St001349The number of different graphs obtained from the given graph by removing an edge. 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. St001400The total number of Littlewood-Richardson tableaux of given shape. St001458The rank of the adjacency matrix of a graph. St001459The number of zero columns in the nullspace of a graph. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001798The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph. St001814The number of partitions interlacing the given partition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001706The number of closed sets in a graph. St000422The energy of a graph, if it is integral. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000264The girth of a graph, which is not a tree. St000258The burning number of a graph. St000918The 2-limited packing number of a graph. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St001060The distinguishing index of a graph. St001116The game chromatic number of a graph. St001261The Castelnuovo-Mumford regularity of a graph. St001494The Alon-Tarsi number of a graph. St001580The acyclic chromatic number of a graph. St001674The number of vertices of the largest induced star graph in the graph. St000260The radius of a connected graph. St000273The domination number of a graph. St000456The monochromatic index of a connected graph. St000535The rank-width of a graph. St000544The cop number of a graph. St000642The size of the smallest orbit of antichains under Panyushev complementation. St000917The open packing number of a graph. St001277The degeneracy of a graph. St001281The normalized isoperimetric number of a graph. St001322The size of a minimal independent dominating set in a graph. St001333The cardinality of a minimal edge-isolating set of a graph. St001339The irredundance number of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001357The maximal degree of a regular spanning subgraph of a graph. St001358The largest degree of a regular subgraph of a graph. St001592The maximal number of simple paths between any two different vertices of a graph. St001654The monophonic hull number of a 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. St001792The arboricity of a graph. St001829The common independence number of a graph. St000181The number of connected components of the Hasse diagram for the poset. St000284The Plancherel distribution on integer partitions. St000379The number of Hamiltonian cycles in a graph. St000553The number of blocks of a graph. St000618The number of self-evacuating tableaux of given shape. St000671The maximin edge-connectivity for choosing a subgraph. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000706The product of the factorials of the multiplicities of an integer partition. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000775The multiplicity of the largest eigenvalue in a graph. St000781The number of proper colouring schemes of a Ferrers diagram. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000908The length of the shortest maximal antichain in a poset. St000914The sum of the values of the Möbius function of a poset. St000928The sum of the coefficients of the character polynomial of an integer partition. St000993The multiplicity of the largest part of an integer partition. St001128The exponens consonantiae of a partition. St001280The number of parts of an integer partition that are at least two. St001282The number of graphs with the same chromatic polynomial. St001352The number of internal nodes in the modular decomposition of a graph. St001353The number of prime nodes in the modular decomposition of a graph. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001432The order dimension of the partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001496The number of graphs with the same Laplacian spectrum as the given graph. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001533The largest coefficient of the Poincare polynomial of the poset cone. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. 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. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. 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. St001890The maximum magnitude of the Möbius function of a poset. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001924The number of cells in an integer partition whose arm and leg length coincide. St001933The largest multiplicity of a part in an integer partition. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000225Difference between largest and smallest parts in a partition. St000281The size of the preimage of the map 'to poset' from Binary trees to Posets. St000283The size of the preimage of the map 'to graph' from Binary trees to Graphs. St000323The minimal crossing number of a graph. St000370The genus of a graph. St000449The number of pairs of vertices of a graph with distance 4. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000552The number of cut vertices of a graph. St000567The sum of the products of all pairs of parts. 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. St000849The number of 1/3-balanced pairs in a poset. St000929The constant term of the character polynomial of an integer partition. St000936The number of even values of the symmetric group character corresponding to the partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St001095The number of non-isomorphic posets with precisely one further covering relation. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001098The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for vertex labelled trees. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001175The size of a partition minus the hook length of the base cell. St001176The size of a partition minus its first part. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. St001248Sum of the even parts of a partition. 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. St001301The first Betti number of the order complex associated with the poset. St001307The number of induced stars on four vertices in a graph. St001309The number of four-cliques in a graph. St001310The number of induced diamond graphs in a graph. St001334The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph. St001347The number of pairs of vertices of a graph having the same neighbourhood. St001354The number of series nodes in the modular decomposition of a graph. St001367The smallest number which does not occur as degree of a vertex in a graph. St001396Number of triples of incomparable elements in a finite poset. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001479The number of bridges of a graph. St001525The number of symmetric hooks on the diagonal of a partition. St001561The value of the elementary symmetric function evaluated at 1. St001570The minimal number of edges to add to make a graph Hamiltonian. St001586The number of odd parts smaller than the largest even part in an integer partition. St001587Half of the largest even part of an integer partition. St001651The Frankl number of a lattice. St001657The number of twos in an integer partition. St001691The number of kings in a graph. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001826The maximal number of leaves on a vertex of a graph. St001939The number of parts that are equal to their multiplicity in the integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St001961The sum of the greatest common divisors of all pairs of parts. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St000699The toughness times the least common multiple of 1,. St001545The second Elser number of a connected graph. St000464The Schultz index of a connected graph. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St000285The size of the preimage of the map 'to inverse des composition' from Parking functions to Integer compositions. St000477The weight of a partition according to Alladi. St000668The least common multiple of the parts of the partition. St000708The product of the parts of an integer partition. St000770The major index of an integer partition when read from bottom to top. St000806The semiperimeter of the associated bargraph. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000514The number of invariant simple graphs when acting with a permutation of given cycle type. St000681The Grundy value of Chomp on Ferrers diagrams. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000818The sum of the entries in the column specified by the composition of the change of basis matrix from quasisymmetric Schur functions to monomial quasisymmetric functions. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St000478Another weight of a partition according to Alladi. St000636The hull number of a graph. St000762The sum of the positions of the weak records of an integer composition. St000815The number of semistandard Young tableaux of partition weight of given shape. St000933The number of multipartitions of sizes given by an integer partition. St000934The 2-degree of an integer partition. St000937The number of positive values of the symmetric group character corresponding to the partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St000259The diameter of a connected graph. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. 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. 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$. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000640The rank of the largest boolean interval in a poset. St000707The product of the factorials of the parts. St000916The packing number of a graph. St001463The number of distinct columns in the nullspace of a graph. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St000447The number of pairs of vertices of a graph with distance 3. St000509The diagonal index (content) of a partition. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000713The dimension of the irreducible representation of Sp(4) labelled by an integer partition. St000716The dimension of the irreducible representation of Sp(6) labelled by an integer partition. St000944The 3-degree of an integer partition. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. St001279The sum of the parts of an integer partition that are at least two. St001541The Gini index of an integer partition. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St000455The second largest eigenvalue of a graph if it is integral. St000997The even-odd crank of an integer partition. St000927The alternating sum of the coefficients of the character polynomial of an integer partition. St000817The sum of the entries in the column specified by the composition of the change of basis matrix from dual immaculate quasisymmetric functions to monomial quasisymmetric functions. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St000822The Hadwiger number of the graph. St001642The Prague dimension of a graph. St001734The lettericity of a graph. St001812The biclique partition number of a graph. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000310The minimal degree of a vertex of a graph. St001577The minimal number of edges to add or remove to make a graph a cograph. St000286The number of connected components of the complement of a graph. St000287The number of connected components of a graph. St001518The number of graphs with the same ordinary spectrum as the given graph. St001572The minimal number of edges to remove to make a graph bipartite. St000276The size of the preimage of the map 'to graph' from Ordered trees to Graphs. St000315The number of isolated vertices of a graph. St000322The skewness of a graph. St001578The minimal number of edges to add or remove to make a graph a line graph. St001871The number of triconnected components of a graph. St000741The Colin de Verdière graph invariant. St000327The number of cover relations in a poset. St001637The number of (upper) dissectors of a poset. St001668The number of points of the poset minus the width of the poset. St000635The number of strictly order preserving maps of a poset into itself. St001498The normalised height of a Nakayama algebra with magnitude 1. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001416The length of a longest palindromic factor of a binary word. St001703The villainy of a graph. St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St001271The competition number of a graph. St001330The hat guessing number of a graph. 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. St001679The number of 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. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001720The minimal length of a chain of small intervals in a lattice. St001754The number of tolerances of a finite lattice. St001820The size of the image of the pop stack sorting operator. St001833The number of linear intervals in a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices. St000454The largest eigenvalue of a graph if it is integral. St001613The binary logarithm of the size of the center of a lattice. St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St001619The number of non-isomorphic sublattices of a lattice. St001620The number of sublattices of a lattice. St001621The number of atoms of a lattice. St001622The number of join-irreducible elements of a lattice. St001623The number of doubly irreducible elements of a lattice. St001626The number of maximal proper sublattices of a lattice. St001644The dimension of a graph. St001666The number of non-isomorphic subposets of a lattice which are lattices. St001677The number of non-degenerate subsets of a lattice whose meet is the bottom element. St001845The number of join irreducibles minus the rank of a lattice. St001846The number of elements which do not have a complement in the lattice. St000189The number of elements in the poset. St000298The order dimension or Dushnik-Miller dimension of a poset. St000307The number of rowmotion orbits of a poset. St000528The height of a poset. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000907The number of maximal antichains of minimal length in a poset. St000911The number of maximal antichains of maximal size in a poset. St000912The number of maximal antichains in a poset. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001268The size of the largest ordinal summand in the poset. St001343The dimension of the reduced incidence algebra of a poset. St001399The distinguishing number of a poset. St001510The number of self-evacuating linear extensions of a finite poset. St001534The alternating sum of the coefficients of the Poincare polynomial of the poset cone. 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. St001717The largest size of an interval in a poset. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001779The order of promotion on the set of linear extensions of a poset. St001813The product of the sizes of the principal order filters in a poset. St001815The number of order preserving surjections from a poset to a total order. St001963The tree-depth of a graph. St000080The rank of the poset. St000104The number of facets in the order polytope of this poset. St000151The number of facets in the chain polytope of the poset. St000180The number of chains of a poset. St000302The determinant of the distance matrix of a connected graph. St000362The size of a minimal vertex cover of a graph. St000466The Gutman (or modified Schultz) index of a connected graph. St000467The hyper-Wiener index of a connected graph. St000479The Ramsey number of a graph. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St001112The 3-weak dynamic number of a graph. St001300The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset. St001397Number of pairs of incomparable elements in a finite poset. St001398Number of subsets of size 3 of elements in a poset that form a "v". St001631The number of simple modules $S$ with $dim Ext^1(S,A)=1$ in the incidence algebra $A$ of the poset. St001655The general position number of a graph. St001664The number of non-isomorphic subposets of a poset. St001718The number of non-empty open intervals in a poset. St001782The order of rowmotion on the set of order ideals of a poset. St001902The number of potential covers of a poset. St001909The number of interval-closed sets of a poset. St001964The interval resolution global dimension of a poset. St000272The treewidth of a graph. St000387The matching number of a graph. St000482The (zero)-forcing number of a graph. St000536The pathwidth of a graph. St001270The bandwidth of a graph. St001316The domatic number of a graph. St001472The permanent of the Coxeter matrix of the poset. St001709The number of homomorphisms to the three element chain of a poset. St001962The proper pathwidth of a graph. St001111The weak 2-dynamic chromatic number of a graph. St001326The minimal number of occurrences of the interval-pattern in a linear ordering of the vertices of the graph. St001331The size of the minimal feedback vertex set. St001638The book thickness of a graph. St001672The restrained domination number of a graph. St001834The number of non-isomorphic minors of a 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. St001305The number of induced cycles on four vertices in a graph. St001324The minimal number of occurrences of the chordal-pattern in a linear ordering of the vertices of the graph. St001325The minimal number of occurrences of the comparability-pattern in a linear ordering of the vertices of the graph. St001739The number of graphs with the same edge polytope as the given graph. St001743The discrepancy of a graph. St001774The degree of the minimal polynomial of the smallest eigenvalue of a graph. St001057The Grundy value of the game of creating an independent set in a graph. St001363The Euler characteristic of a graph according to Knill. St001793The difference between the clique number and the chromatic number of a graph. St001797The number of overfull subgraphs of a graph. St001957The number of Hasse diagrams with a given underlying undirected graph. St000026The position of the first return of a Dyck path. St001502The global dimension minus the dominant dimension of magnitude 1 Nakayama algebras. St001584The area statistic between a Dyck path and its bounce path. St000376The bounce deficit of a Dyck path. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St001500The global dimension of magnitude 1 Nakayama algebras. 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. St001875The number of simple modules with projective dimension at most 1. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001529The number of monomials in the expansion of the nabla operator applied to the power-sum symmetric function indexed by the partition. St000403The Szeged index minus the Wiener index of a graph. St000448The number of pairs of vertices of a graph with distance 2. St001306The number of induced paths on four vertices in a graph. St001308The number of induced paths on three vertices in a graph. St001341The number of edges in the center of a graph. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001794Half the number of sets of vertices in a graph which are dominating and non-blocking. St000266The number of spanning subgraphs of a graph with the same connected components. St000299The number of nonisomorphic vertex-induced subtrees. St000948The chromatic discriminant of a graph. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001093The detour number of a graph. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand 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. St001475The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,0). St001477The number of nowhere zero 5-flows of a graph. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St000087The number of induced subgraphs. St000172The Grundy number of a graph. St000469The distinguishing number of a graph. St001117The game chromatic index of a graph. St001315The dissociation number of a graph. St001320The minimal number of occurrences of the path-pattern in a linear ordering of the vertices of the graph. St001327The minimal number of occurrences of the split-pattern in a linear ordering of the vertices of the graph. St001476The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,-1). St001478The number of nowhere zero 4-flows of a graph. St001512The minimum rank of a graph. St001581The achromatic number of a graph. St001648The number of edges that can be added without increasing the chromatic number. St001670The connected partition number of a graph. St001883The mutual visibility number of a graph. St000086The number of subgraphs. St000268The number of strongly connected orientations of a graph. St000351The determinant of the adjacency matrix of a graph. St000450The number of edges minus the number of vertices plus 2 of a graph. St000778The metric dimension of a graph. St001073The number of nowhere zero 3-flows of a graph. St001286The annihilation number of a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001656The monophonic position number of a graph. St001776The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph. St001949The rigidity index of a graph. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by $4$. St000344The number of strongly connected outdegree sequences of a graph. St000388The number of orbits of vertices of a graph under automorphisms. St000785The number of distinct colouring schemes of a graph. St001056The Grundy value for the game of deleting vertices of a graph until it has no edges. St001070The absolute value of the derivative of the chromatic polynomial of the graph at 1. St001071The beta invariant of the graph. St001272The number of graphs with the same degree sequence. St001311The cyclomatic number of a graph. St001317The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the graph. St001328The minimal number of occurrences of the bipartite-pattern in a linear ordering of the vertices of the graph. St001393The induced matching number of a graph. St001736The total number of cycles in a graph. St001775The degree of the minimal polynomial of the largest eigenvalue of a graph. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St000095The number of triangles of a graph. St000244The cardinality of the automorphism group of a graph. St000350The sum of the vertex degrees of a graph. St000364The exponent of the automorphism group of a graph. St001069The coefficient of the monomial xy of the Tutte polynomial of the graph. St001323The independence gap of a graph. St001329The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001350Half of the Albertson index of a graph. St001351The Albertson index of a graph. St001374The Padmakar-Ivan index of a graph. St001521Half the total irregularity of a graph. St001522The total irregularity of a graph. St001573The minimal number of edges to remove to make a graph triangle-free. 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. St001646The number of edges that can be added without increasing the maximal degree of a graph. St001647The number of edges that can be added without increasing the clique number. St001689The number of celebrities in a graph. St001690The length of a longest path in a graph such that after removing the paths edges, every vertex of the path has distance two from some other vertex of the path. St001692The number of vertices with higher degree than the average degree in a graph. St001708The number of pairs of vertices of different degree in a graph. St001742The difference of the maximal and the minimal degree in a graph. St001795The binary logarithm of the evaluation of the Tutte polynomial of the graph at (x,y) equal to (-1,-1). St001799The number of proper separations of a graph. St001802The number of endomorphisms of a graph. St001827The number of two-component spanning forests of a graph. St001828The Euler characteristic of a graph. St000301The number of facets of the stable set polytope of a graph. St000468The Hosoya index of a graph. St000349The number of different adjacency matrices of a graph. St000265The Wiener index of a graph. St001764The number of non-convex subsets of vertices in a graph. St001762The number of convex subsets of vertices in a graph. St000263The Szeged index of a graph. St000361The second Zagreb index of a graph. St000465The first Zagreb index of a graph. St001765The number of connected components of the friends and strangers graph. St001303The number of dominating sets of vertices of a graph. St001441The number of non-empty connected induced subgraphs of a graph. St001627The number of coloured connected graphs such that the multiplicities of colours are given by a partition. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001917The order of toric promotion on the set of labellings of a graph. St000972The composition number of a graph. St001474The evaluation of the Tutte polynomial of the graph at (x,y) equal to (2,-1). St000269The number of acyclic orientations of a graph. St001109The number of proper colourings of a graph with as few colours as possible. St001757The number of orbits of toric promotion on a graph. St000270The number of forests contained in a graph. St000343The number of spanning subgraphs of a graph. St001607The number of coloured graphs such that the multiplicities of colours are given by a partition. St000571The F-index (or forgotten topological index) of a graph. St001758The number of orbits of promotion on a graph. St001362The normalized Knill dimension of a graph. St001072The evaluation of the Tutte polynomial of the graph at x and y equal to 3.
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!