searching the database
Your data matches 120 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: St000093
(load all 12 compositions to match this statistic)
(load all 12 compositions to match this statistic)
Values
([],1)
=> 1
([],2)
=> 2
([(0,1)],2)
=> 1
([],3)
=> 3
([(1,2)],3)
=> 2
([(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(1,2)],3)
=> 1
([],4)
=> 4
([(2,3)],4)
=> 3
([(1,3),(2,3)],4)
=> 3
([(0,3),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2)],4)
=> 2
([(0,3),(1,2),(2,3)],4)
=> 2
([(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([],5)
=> 5
([(3,4)],5)
=> 4
([(2,4),(3,4)],5)
=> 4
([(1,4),(2,4),(3,4)],5)
=> 4
([(0,4),(1,4),(2,4),(3,4)],5)
=> 4
([(1,4),(2,3)],5)
=> 3
([(1,4),(2,3),(3,4)],5)
=> 3
([(0,1),(2,4),(3,4)],5)
=> 3
([(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,3),(3,4)],5)
=> 3
([(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(1,3),(1,4),(2,3),(2,4)],5)
=> 3
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 3
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,3),(2,3),(2,4)],5)
=> 3
([(0,1),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 2
Description
The cardinality of a maximal independent set of vertices of a graph.
An independent set of a graph is a set of pairwise non-adjacent vertices. A maximum independent set is an independent set of maximum cardinality. This statistic is also called the independence number or stability number $\alpha(G)$ of $G$.
Matching statistic: St000786
(load all 11 compositions to match this statistic)
(load all 11 compositions to match this statistic)
Values
([],1)
=> 1
([],2)
=> 2
([(0,1)],2)
=> 1
([],3)
=> 3
([(1,2)],3)
=> 2
([(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(1,2)],3)
=> 1
([],4)
=> 4
([(2,3)],4)
=> 3
([(1,3),(2,3)],4)
=> 3
([(0,3),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2)],4)
=> 2
([(0,3),(1,2),(2,3)],4)
=> 2
([(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([],5)
=> 5
([(3,4)],5)
=> 4
([(2,4),(3,4)],5)
=> 4
([(1,4),(2,4),(3,4)],5)
=> 4
([(0,4),(1,4),(2,4),(3,4)],5)
=> 4
([(1,4),(2,3)],5)
=> 3
([(1,4),(2,3),(3,4)],5)
=> 3
([(0,1),(2,4),(3,4)],5)
=> 3
([(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,3),(3,4)],5)
=> 3
([(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(1,3),(1,4),(2,3),(2,4)],5)
=> 3
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 3
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,3),(2,3),(2,4)],5)
=> 3
([(0,1),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 2
Description
The maximal number of occurrences of a colour in a proper colouring of a graph.
To any proper colouring with the minimal number of colours possible we associate the integer partition recording how often each colour is used. This statistic records the largest part occurring in any of these partitions.
For example, the graph on six vertices consisting of a square together with two attached triangles - ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(3,5),(4,5)],6) in the list of values - is three-colourable and admits two colouring schemes, $[2,2,2]$ and $[3,2,1]$. Therefore, the statistic on this graph is $3$.
Matching statistic: St001337
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Values
([],1)
=> 1
([],2)
=> 2
([(0,1)],2)
=> 1
([],3)
=> 3
([(1,2)],3)
=> 2
([(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(1,2)],3)
=> 1
([],4)
=> 4
([(2,3)],4)
=> 3
([(1,3),(2,3)],4)
=> 3
([(0,3),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2)],4)
=> 2
([(0,3),(1,2),(2,3)],4)
=> 2
([(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([],5)
=> 5
([(3,4)],5)
=> 4
([(2,4),(3,4)],5)
=> 4
([(1,4),(2,4),(3,4)],5)
=> 4
([(0,4),(1,4),(2,4),(3,4)],5)
=> 4
([(1,4),(2,3)],5)
=> 3
([(1,4),(2,3),(3,4)],5)
=> 3
([(0,1),(2,4),(3,4)],5)
=> 3
([(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,3),(3,4)],5)
=> 3
([(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(1,3),(1,4),(2,3),(2,4)],5)
=> 3
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 3
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,3),(2,3),(2,4)],5)
=> 3
([(0,1),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 2
Description
The upper domination number of a graph.
This is the maximum cardinality of a minimal dominating set of $G$.
The smallest graph with different upper irredundance number and upper domination number has eight vertices. It is obtained from the disjoint union of two copies of $K_4$ by joining three of the four vertices of the first with three of the four vertices of the second. For bipartite graphs the two parameters always coincide [1].
Matching statistic: St001338
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Values
([],1)
=> 1
([],2)
=> 2
([(0,1)],2)
=> 1
([],3)
=> 3
([(1,2)],3)
=> 2
([(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(1,2)],3)
=> 1
([],4)
=> 4
([(2,3)],4)
=> 3
([(1,3),(2,3)],4)
=> 3
([(0,3),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2)],4)
=> 2
([(0,3),(1,2),(2,3)],4)
=> 2
([(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([],5)
=> 5
([(3,4)],5)
=> 4
([(2,4),(3,4)],5)
=> 4
([(1,4),(2,4),(3,4)],5)
=> 4
([(0,4),(1,4),(2,4),(3,4)],5)
=> 4
([(1,4),(2,3)],5)
=> 3
([(1,4),(2,3),(3,4)],5)
=> 3
([(0,1),(2,4),(3,4)],5)
=> 3
([(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,3),(3,4)],5)
=> 3
([(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(1,3),(1,4),(2,3),(2,4)],5)
=> 3
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 3
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,3),(2,3),(2,4)],5)
=> 3
([(0,1),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 2
Description
The upper irredundance number of a graph.
A set $S$ of vertices is irredundant, if there is no vertex in $S$, whose closed neighbourhood is contained in the union of the closed neighbourhoods of the other vertices of $S$.
The upper irredundance number is the largest size of a maximal irredundant set.
The smallest graph with different upper irredundance number and upper domination number [[St001337]] has eight vertices. It is obtained from the disjoint union of two copies of $K_4$ by joining three of the four vertices of the first with three of the four vertices of the second. For bipartite graphs the two parameters always coincide [2].
Matching statistic: St000097
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 1
([],2)
=> ([(0,1)],2)
=> 2
([(0,1)],2)
=> ([],2)
=> 1
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 2
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 2
([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 1
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 2
([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 1
([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 3
([(1,4),(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 3
([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 3
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 3
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 3
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 3
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,3)],5)
=> 2
Description
The order of the largest clique of the graph.
A clique in a graph $G$ is a subset $U \subseteq V(G)$ such that any pair of vertices in $U$ are adjacent. I.e. the subgraph induced by $U$ is a complete graph.
Matching statistic: St000381
(load all 16 compositions to match this statistic)
(load all 16 compositions to match this statistic)
Mp00324: Graphs —chromatic difference sequence⟶ Integer compositions
St000381: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000381: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
=> [1] => 1
([],2)
=> [2] => 2
([(0,1)],2)
=> [1,1] => 1
([],3)
=> [3] => 3
([(1,2)],3)
=> [2,1] => 2
([(0,2),(1,2)],3)
=> [2,1] => 2
([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => 1
([],4)
=> [4] => 4
([(2,3)],4)
=> [3,1] => 3
([(1,3),(2,3)],4)
=> [3,1] => 3
([(0,3),(1,3),(2,3)],4)
=> [3,1] => 3
([(0,3),(1,2)],4)
=> [2,2] => 2
([(0,3),(1,2),(2,3)],4)
=> [2,2] => 2
([(1,2),(1,3),(2,3)],4)
=> [2,1,1] => 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> [2,2] => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => 1
([],5)
=> [5] => 5
([(3,4)],5)
=> [4,1] => 4
([(2,4),(3,4)],5)
=> [4,1] => 4
([(1,4),(2,4),(3,4)],5)
=> [4,1] => 4
([(0,4),(1,4),(2,4),(3,4)],5)
=> [4,1] => 4
([(1,4),(2,3)],5)
=> [3,2] => 3
([(1,4),(2,3),(3,4)],5)
=> [3,2] => 3
([(0,1),(2,4),(3,4)],5)
=> [3,2] => 3
([(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 3
([(0,4),(1,4),(2,3),(3,4)],5)
=> [3,2] => 3
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 3
([(1,3),(1,4),(2,3),(2,4)],5)
=> [3,2] => 3
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [3,2] => 3
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [3,2] => 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 3
([(0,4),(1,3),(2,3),(2,4)],5)
=> [3,2] => 3
([(0,1),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [2,2,1] => 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [2,2,1] => 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => 2
Description
The largest part of an integer composition.
Matching statistic: St000382
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00324: Graphs —chromatic difference sequence⟶ Integer compositions
St000382: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000382: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
=> [1] => 1
([],2)
=> [2] => 2
([(0,1)],2)
=> [1,1] => 1
([],3)
=> [3] => 3
([(1,2)],3)
=> [2,1] => 2
([(0,2),(1,2)],3)
=> [2,1] => 2
([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => 1
([],4)
=> [4] => 4
([(2,3)],4)
=> [3,1] => 3
([(1,3),(2,3)],4)
=> [3,1] => 3
([(0,3),(1,3),(2,3)],4)
=> [3,1] => 3
([(0,3),(1,2)],4)
=> [2,2] => 2
([(0,3),(1,2),(2,3)],4)
=> [2,2] => 2
([(1,2),(1,3),(2,3)],4)
=> [2,1,1] => 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> [2,2] => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => 1
([],5)
=> [5] => 5
([(3,4)],5)
=> [4,1] => 4
([(2,4),(3,4)],5)
=> [4,1] => 4
([(1,4),(2,4),(3,4)],5)
=> [4,1] => 4
([(0,4),(1,4),(2,4),(3,4)],5)
=> [4,1] => 4
([(1,4),(2,3)],5)
=> [3,2] => 3
([(1,4),(2,3),(3,4)],5)
=> [3,2] => 3
([(0,1),(2,4),(3,4)],5)
=> [3,2] => 3
([(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 3
([(0,4),(1,4),(2,3),(3,4)],5)
=> [3,2] => 3
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 3
([(1,3),(1,4),(2,3),(2,4)],5)
=> [3,2] => 3
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [3,2] => 3
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [3,2] => 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 3
([(0,4),(1,3),(2,3),(2,4)],5)
=> [3,2] => 3
([(0,1),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [2,2,1] => 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [2,2,1] => 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => 2
Description
The first part of an integer composition.
Matching statistic: St000808
(load all 12 compositions to match this statistic)
(load all 12 compositions to match this statistic)
Mp00324: Graphs —chromatic difference sequence⟶ Integer compositions
St000808: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000808: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
=> [1] => 1
([],2)
=> [2] => 2
([(0,1)],2)
=> [1,1] => 1
([],3)
=> [3] => 3
([(1,2)],3)
=> [2,1] => 2
([(0,2),(1,2)],3)
=> [2,1] => 2
([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => 1
([],4)
=> [4] => 4
([(2,3)],4)
=> [3,1] => 3
([(1,3),(2,3)],4)
=> [3,1] => 3
([(0,3),(1,3),(2,3)],4)
=> [3,1] => 3
([(0,3),(1,2)],4)
=> [2,2] => 2
([(0,3),(1,2),(2,3)],4)
=> [2,2] => 2
([(1,2),(1,3),(2,3)],4)
=> [2,1,1] => 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> [2,2] => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => 1
([],5)
=> [5] => 5
([(3,4)],5)
=> [4,1] => 4
([(2,4),(3,4)],5)
=> [4,1] => 4
([(1,4),(2,4),(3,4)],5)
=> [4,1] => 4
([(0,4),(1,4),(2,4),(3,4)],5)
=> [4,1] => 4
([(1,4),(2,3)],5)
=> [3,2] => 3
([(1,4),(2,3),(3,4)],5)
=> [3,2] => 3
([(0,1),(2,4),(3,4)],5)
=> [3,2] => 3
([(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 3
([(0,4),(1,4),(2,3),(3,4)],5)
=> [3,2] => 3
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 3
([(1,3),(1,4),(2,3),(2,4)],5)
=> [3,2] => 3
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [3,2] => 3
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [3,2] => 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 3
([(0,4),(1,3),(2,3),(2,4)],5)
=> [3,2] => 3
([(0,1),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [2,2,1] => 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [2,2,1] => 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => 2
Description
The number of up steps of the associated bargraph.
Interpret the composition as the sequence of heights of the bars of a bargraph. This statistic is the number of up steps.
Matching statistic: St001323
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Values
([],1)
=> ([(0,1)],2)
=> 0 = 1 - 1
([],2)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 0 = 1 - 1
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0 = 1 - 1
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 3 = 4 - 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)
=> 1 = 2 - 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 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 = 2 - 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 = 2 - 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 = 2 - 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 - 1
([],5)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 4 = 5 - 1
([(3,4)],5)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 4 - 1
([(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 4 - 1
([(1,4),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 4 - 1
([(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)
=> 3 = 4 - 1
([(1,4),(2,3)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 2 = 3 - 1
([(1,4),(2,3),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
([(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),(1,4),(2,3),(2,4)],5)
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 2 = 3 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
([(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),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 2 = 3 - 1
([(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,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 2 = 3 - 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1 = 2 - 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,5),(1,2),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1 = 2 - 1
([(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)
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 1 = 2 - 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1 = 2 - 1
([(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)
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1 = 2 - 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1 = 2 - 1
([(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)
=> 1 = 2 - 1
([(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)
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 1 = 2 - 1
([(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)
=> 1 = 2 - 1
Description
The independence gap of a graph.
This is the difference between the independence number [[St000093]] and the minimal size of a maximally independent set of a graph.
In particular, this statistic is $0$ for well covered graphs
Matching statistic: St001674
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Values
([],1)
=> ([(0,1)],2)
=> 2 = 1 + 1
([],2)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> 4 = 3 + 1
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 5 = 4 + 1
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 3 + 1
([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 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)
=> 4 = 3 + 1
([(0,3),(1,2)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 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 = 2 + 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 = 2 + 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 = 2 + 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)
=> 2 = 1 + 1
([],5)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 6 = 5 + 1
([(3,4)],5)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 5 = 4 + 1
([(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 5 = 4 + 1
([(1,4),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 5 = 4 + 1
([(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)
=> 5 = 4 + 1
([(1,4),(2,3)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(1,4),(2,3),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(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)
=> 4 = 3 + 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(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)
=> 4 = 3 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(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)
=> 4 = 3 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 2 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,5),(1,2),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 2 + 1
([(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 = 2 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 3 = 2 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 2 + 1
([(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 = 2 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 2 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 2 + 1
([(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 = 2 + 1
([(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 = 2 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 3 = 2 + 1
([(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 = 2 + 1
Description
The number of vertices of the largest induced star graph in the graph.
The following 110 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000013The height of a Dyck path. St000025The number of initial rises of a Dyck path. St000026The position of the first return of a Dyck path. St000147The largest part of an integer partition. St000335The difference of lower and upper interactions. St000383The last part of an integer composition. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001316The domatic number of a graph. St001330The hat guessing number of a graph. St001654The monophonic hull number of a graph. St001656The monophonic position number of a graph. St001809The index of the step at the first peak of maximal height in a Dyck path. St000089The absolute variation of a composition. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000439The position of the first down step of a Dyck path. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St000010The length of the partition. St000273The domination number of a graph. St000286The number of connected components of the complement of a graph. St000287The number of connected components of a graph. St000297The number of leading ones in a binary word. St000363The number of minimal vertex covers of a graph. St000392The length of the longest run of ones in a binary word. St000482The (zero)-forcing number of a graph. St000544The cop number of a graph. St000667The greatest common divisor of the parts of the partition. St000676The number of odd rises of a Dyck path. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000734The last entry in the first row of a standard tableau. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000765The number of weak records in an integer composition. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000778The metric dimension of a graph. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St000899The maximal number of repetitions of an integer composition. St000904The maximal number of repetitions of an integer composition. St000916The packing number of a graph. St000917The open packing number of a graph. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000992The alternating sum of the parts of an integer partition. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001055The Grundy value for the game of removing cells of a row in an integer partition. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001286The annihilation number of a graph. St001322The size of a minimal independent dominating set in a graph. St001339The irredundance number of a graph. St001357The maximal degree of a regular spanning subgraph of a graph. St001358The largest degree of a regular subgraph of a graph. St001363The Euler characteristic of a graph according to Knill. St001415The length of the longest palindromic prefix of a binary word. St001530The depth of a Dyck path. St001571The Cartan determinant of the integer partition. St001829The common independence number of a graph. St001949The rigidity index of a graph. St000090The variation of a composition. St000091The descent variation of a composition. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000310The minimal degree of a vertex of a graph. St000469The distinguishing number of a graph. St000636The hull number of a graph. St000969We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n-1}]$ by adding $c_0$ to $c_{n-1}$. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001655The general position number of a graph. St001777The number of weak descents in an integer composition. St001814The number of partitions interlacing the given partition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St000444The length of the maximal rise of a Dyck path. St000442The maximal area to the right of an up step of a Dyck path. St000741The Colin de Verdière graph invariant. St000454The largest eigenvalue of a graph if it is integral. St000678The number of up steps after the last double rise of a Dyck path. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St000932The number of occurrences of the pattern UDU in a Dyck path. St000477The weight of a partition according to Alladi. St000668The least common multiple of the parts of the partition. St000770The major index of an integer partition when read from bottom to top. St001498The normalised height of a Nakayama algebra with magnitude 1. St001651The Frankl number of a lattice. St000455The second largest eigenvalue of a graph if it is integral. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001875The number of simple modules with projective dimension at most 1. St001877Number of indecomposable injective modules with projective dimension 2. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001578The minimal number of edges to add or remove to make a graph a line graph. St001621The number of atoms of a lattice. St001624The breadth of a lattice. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001890The maximum magnitude of the Möbius function of a poset. St001060The distinguishing index of a graph. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St000264The girth of a graph, which is not a tree. St001645The pebbling number of a connected graph.
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!