searching the database
Your data matches 78 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: St000822
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Values
([],1)
=> ([(0,1)],2)
=> 2
([],2)
=> ([(0,2),(1,2)],3)
=> 2
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> 2
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(1,2)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 3
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 4
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([],0)
=> ([],1)
=> 1
Description
The Hadwiger number of the graph.
Also known as clique contraction number, this is the size of the largest complete minor.
Matching statistic: St001580
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Values
([],1)
=> ([(0,1)],2)
=> 2
([],2)
=> ([(0,2),(1,2)],3)
=> 2
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> 2
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(1,2)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 3
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 4
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([],0)
=> ([],1)
=> 1
Description
The acyclic chromatic number of a graph.
This is the smallest size of a vertex partition $\{V_1,\dots,V_k\}$ such that each $V_i$ is an independent set and for all $i,j$ the subgraph inducted by $V_i\cup V_j$ does not contain a cycle.
Matching statistic: St000272
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Values
([],1)
=> ([(0,1)],2)
=> 1 = 2 - 1
([],2)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> 1 = 2 - 1
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
([(0,3),(1,2)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 2 = 3 - 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 4 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 4 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 3 = 4 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 4 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 5 - 1
([],0)
=> ([],1)
=> 0 = 1 - 1
Description
The treewidth of a graph.
A graph has treewidth zero if and only if it has no edges. A connected graph has treewidth at most one if and only if it is a tree. A connected graph has treewidth at most two if and only if it is a series-parallel graph.
Matching statistic: St000536
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Values
([],1)
=> ([(0,1)],2)
=> 1 = 2 - 1
([],2)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> 1 = 2 - 1
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
([(0,3),(1,2)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 2 = 3 - 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 4 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 4 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 3 = 4 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 4 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 5 - 1
([],0)
=> ([],1)
=> 0 = 1 - 1
Description
The pathwidth of a graph.
Matching statistic: St001277
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Values
([],1)
=> ([(0,1)],2)
=> 1 = 2 - 1
([],2)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> 1 = 2 - 1
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
([(0,3),(1,2)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 2 = 3 - 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 4 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 4 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 3 = 4 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 4 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 5 - 1
([],0)
=> ([],1)
=> 0 = 1 - 1
Description
The degeneracy of a graph.
The degeneracy of a graph $G$ is the maximum of the minimum degrees of the (vertex induced) subgraphs of $G$.
Matching statistic: St001358
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Values
([],1)
=> ([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([],2)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
([(0,3),(1,2)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 5
([],0)
=> ([],1)
=> ([(0,1)],2)
=> 1
Description
The largest degree of a regular subgraph of a graph.
For $k > 2$, it is an NP-complete problem to determine whether a graph has a $k$-regular subgraph, see [1].
Matching statistic: St001331
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Values
([],1)
=> ([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 2 - 1
([],2)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 4 - 1
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1 = 2 - 1
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
([(0,3),(1,2)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 4 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 4 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 4 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 4 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4 = 5 - 1
([],0)
=> ([],1)
=> ([(0,1)],2)
=> 0 = 1 - 1
Description
The size of the minimal feedback vertex set.
A feedback vertex set is a set of vertices whose removal results in an acyclic graph.
Matching statistic: St001746
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
([],1)
=> ([(0,1)],2)
=> ([(1,2)],3)
=> 3 = 2 + 1
([],2)
=> ([(0,2),(1,2)],3)
=> ([(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(1,2),(1,3),(2,3)],4)
=> 4 = 3 + 1
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(1,4),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 3 + 1
([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 3 + 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5 = 4 + 1
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,5),(2,5),(3,5),(4,5)],6)
=> 3 = 2 + 1
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(0,3),(1,2)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 5 = 4 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 5 = 4 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 5 = 4 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 5 = 4 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6 = 5 + 1
([],0)
=> ([],1)
=> ([],2)
=> 2 = 1 + 1
Description
The coalition number of a graph.
This is the maximal cardinality of a set partition such that each block is either a dominating set of cardinality one, or is not a dominating set but can be joined with a second block to form a dominating set.
Matching statistic: St001330
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Values
([],1)
=> 1 = 2 - 1
([],2)
=> 1 = 2 - 1
([(0,1)],2)
=> 2 = 3 - 1
([],3)
=> 1 = 2 - 1
([(1,2)],3)
=> 2 = 3 - 1
([(0,2),(1,2)],3)
=> 2 = 3 - 1
([(0,1),(0,2),(1,2)],3)
=> 3 = 4 - 1
([],4)
=> 1 = 2 - 1
([(2,3)],4)
=> 2 = 3 - 1
([(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,3),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,3),(1,2)],4)
=> 2 = 3 - 1
([(0,3),(1,2),(2,3)],4)
=> 2 = 3 - 1
([(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ? = 4 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> 3 = 4 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ? = 4 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4 = 5 - 1
([],0)
=> ? = 1 - 1
Description
The hat guessing number of a graph.
Suppose that each vertex of a graph corresponds to a player, wearing a hat whose color is arbitrarily chosen from a set of $q$ possible colors. Each player can see the hat colors of his neighbors, but not his own hat color. All of the players are asked to guess their own hat colors simultaneously, according to a predetermined guessing strategy and the hat colors they see, where no communication between them is allowed. The hat guessing number $HG(G)$ of a graph $G$ is the largest integer $q$ such that there exists a guessing strategy guaranteeing at least one correct guess for any hat assignment of $q$ possible colors.
Because it suffices that a single player guesses correctly, the hat guessing number of a graph is the maximum of the hat guessing numbers of its connected components.
Matching statistic: St000454
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00324: Graphs —chromatic difference sequence⟶ Integer compositions
Mp00038: Integer compositions —reverse⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000454: Graphs ⟶ ℤResult quality: 79% ●values known / values provided: 79%●distinct values known / distinct values provided: 80%
Mp00038: Integer compositions —reverse⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000454: Graphs ⟶ ℤResult quality: 79% ●values known / values provided: 79%●distinct values known / distinct values provided: 80%
Values
([],1)
=> [1] => [1] => ([],1)
=> 0 = 2 - 2
([],2)
=> [2] => [2] => ([],2)
=> 0 = 2 - 2
([(0,1)],2)
=> [1,1] => [1,1] => ([(0,1)],2)
=> 1 = 3 - 2
([],3)
=> [3] => [3] => ([],3)
=> 0 = 2 - 2
([(1,2)],3)
=> [2,1] => [1,2] => ([(1,2)],3)
=> 1 = 3 - 2
([(0,2),(1,2)],3)
=> [2,1] => [1,2] => ([(1,2)],3)
=> 1 = 3 - 2
([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 2 = 4 - 2
([],4)
=> [4] => [4] => ([],4)
=> 0 = 2 - 2
([(2,3)],4)
=> [3,1] => [1,3] => ([(2,3)],4)
=> 1 = 3 - 2
([(1,3),(2,3)],4)
=> [3,1] => [1,3] => ([(2,3)],4)
=> 1 = 3 - 2
([(0,3),(1,3),(2,3)],4)
=> [3,1] => [1,3] => ([(2,3)],4)
=> 1 = 3 - 2
([(0,3),(1,2)],4)
=> [2,2] => [2,2] => ([(1,3),(2,3)],4)
=> ? = 3 - 2
([(0,3),(1,2),(2,3)],4)
=> [2,2] => [2,2] => ([(1,3),(2,3)],4)
=> ? = 3 - 2
([(1,2),(1,3),(2,3)],4)
=> [2,1,1] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2 = 4 - 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2 = 4 - 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> [2,2] => [2,2] => ([(1,3),(2,3)],4)
=> ? = 4 - 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2 = 4 - 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 5 - 2
([],0)
=> ? => ? => ?
=> ? = 1 - 2
Description
The largest eigenvalue of a graph if it is integral.
If a graph is $d$-regular, then its largest eigenvalue equals $d$. One can show that the largest eigenvalue always lies between the average degree and the maximal degree.
This statistic is undefined if the largest eigenvalue of the graph is not integral.
The following 68 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001180Number of indecomposable injective modules with projective dimension at most 1. 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. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000335The difference of lower and upper interactions. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001021Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the Dyck path. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001812The biclique partition number of a graph. St001651The Frankl number of a lattice. St000741The Colin de Verdière graph invariant. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001645The pebbling number of a connected graph. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000466The Gutman (or modified Schultz) index of a connected graph. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001644The dimension of a graph. St001890The maximum magnitude of the Möbius function of a poset. St000285The size of the preimage of the map 'to inverse des composition' from Parking functions to Integer compositions. St000455The second largest eigenvalue of a graph if it is integral. 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$. St000706The product of the factorials of the multiplicities of an integer partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St000993The multiplicity of the largest part of an integer partition. St001568The smallest positive integer that does not appear twice in the partition. St000567The sum of the products of all pairs of parts. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000929The constant term of the character polynomial of an integer partition. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St001875The number of simple modules with projective dimension at most 1. St001570The minimal number of edges to add to make a graph Hamiltonian. St000478Another weight of a partition according to Alladi. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000464The Schultz index of a connected graph. St001545The second Elser number of a connected graph. St000456The monochromatic index of a connected graph. St001060The distinguishing index of a graph. St000699The toughness times the least common multiple of 1,. 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. St001592The maximal number of simple paths between any two different vertices of a graph. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St001877Number of indecomposable injective modules with projective dimension 2. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000302The determinant of the distance matrix of a connected graph. St000467The hyper-Wiener index of a connected graph. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000681The Grundy value of Chomp on Ferrers diagrams. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000941The number of characters of the symmetric group whose value on the partition is even.
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!