Your data matches 177 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
St001304: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> 1
([],2)
=> 1
([(0,1)],2)
=> 2
([],3)
=> 1
([(1,2)],3)
=> 2
([(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(1,2)],3)
=> 3
([],4)
=> 1
([(2,3)],4)
=> 2
([(1,3),(2,3)],4)
=> 2
([(0,3),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2)],4)
=> 4
([(0,3),(1,2),(2,3)],4)
=> 3
([(1,2),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([],5)
=> 1
([(3,4)],5)
=> 2
([(2,4),(3,4)],5)
=> 2
([(1,4),(2,4),(3,4)],5)
=> 2
([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
([(1,4),(2,3)],5)
=> 4
([(1,4),(2,3),(3,4)],5)
=> 3
([(0,1),(2,4),(3,4)],5)
=> 4
([(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)
=> 2
([(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)
=> 2
([(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)
=> 4
([(0,1),(2,3),(2,4),(3,4)],5)
=> 6
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 5
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 5
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 4
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 4
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 3
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 3
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.
Mp00251: Graphs clique sizesInteger partitions
St000010: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> [1]
=> 1
([],2)
=> [1,1]
=> 2
([(0,1)],2)
=> [2]
=> 1
([],3)
=> [1,1,1]
=> 3
([(1,2)],3)
=> [2,1]
=> 2
([(0,2),(1,2)],3)
=> [2,2]
=> 2
([(0,1),(0,2),(1,2)],3)
=> [3]
=> 1
([],4)
=> [1,1,1,1]
=> 4
([(2,3)],4)
=> [2,1,1]
=> 3
([(1,3),(2,3)],4)
=> [2,2,1]
=> 3
([(0,3),(1,3),(2,3)],4)
=> [2,2,2]
=> 3
([(0,3),(1,2)],4)
=> [2,2]
=> 2
([(0,3),(1,2),(2,3)],4)
=> [2,2,2]
=> 3
([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,2]
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> [2,2,2,2]
=> 4
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [3,3]
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 1
([],5)
=> [1,1,1,1,1]
=> 5
([(3,4)],5)
=> [2,1,1,1]
=> 4
([(2,4),(3,4)],5)
=> [2,2,1,1]
=> 4
([(1,4),(2,4),(3,4)],5)
=> [2,2,2,1]
=> 4
([(0,4),(1,4),(2,4),(3,4)],5)
=> [2,2,2,2]
=> 4
([(1,4),(2,3)],5)
=> [2,2,1]
=> 3
([(1,4),(2,3),(3,4)],5)
=> [2,2,2,1]
=> 4
([(0,1),(2,4),(3,4)],5)
=> [2,2,2]
=> 3
([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> 3
([(0,4),(1,4),(2,3),(3,4)],5)
=> [2,2,2,2]
=> 4
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,2,1]
=> 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,2,2]
=> 3
([(1,3),(1,4),(2,3),(2,4)],5)
=> [2,2,2,2,1]
=> 5
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [2,2,2,2,2]
=> 5
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,3,1]
=> 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,2,2]
=> 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,3,2]
=> 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [2,2,2,2,2,2]
=> 6
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,3,3]
=> 3
([(0,4),(1,3),(2,3),(2,4)],5)
=> [2,2,2,2]
=> 4
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,2]
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,2,2]
=> 3
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [2,2,2,2,2]
=> 5
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,2,2,2]
=> 4
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,3,3]
=> 3
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,3,2]
=> 3
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,2]
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,3]
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [3,3,2,2]
=> 4
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [3,3,3,3]
=> 4
Description
The length of the partition.
Matching statistic: St000087
Mp00203: Graphs coneGraphs
Mp00250: Graphs clique graphGraphs
St000087: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([(0,1)],2)
=> ([],1)
=> 1
([],2)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> 1
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 1
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(0,3),(1,2)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
([(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,1)],2)
=> 2
([(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,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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,1)],2)
=> 2
([(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)
=> 1
([],5)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(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,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(1,4),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(1,4),(2,3)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,4),(2,3),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(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)
=> 6
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
Description
The number of induced subgraphs. A subgraph $H \subseteq G$ is induced if $E(H)$ consists of all edges in $E(G)$ that connect the vertices of $H$.
Matching statistic: St000097
Mp00203: Graphs coneGraphs
Mp00250: Graphs clique graphGraphs
St000097: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([(0,1)],2)
=> ([],1)
=> 1
([],2)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> 1
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 1
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(0,3),(1,2)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
([(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,1)],2)
=> 2
([(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,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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,1)],2)
=> 2
([(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)
=> 1
([],5)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(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,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(1,4),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(1,4),(2,3)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,4),(2,3),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(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)
=> 6
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
Description
The order of the largest clique of the graph. A clique in a graph $G$ is a subset $U \subseteq V(G)$ such that any pair of vertices in $U$ are adjacent. I.e. the subgraph induced by $U$ is a complete graph.
Matching statistic: St000098
Mp00203: Graphs coneGraphs
Mp00250: Graphs clique graphGraphs
St000098: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([(0,1)],2)
=> ([],1)
=> 1
([],2)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> 1
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 1
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(0,3),(1,2)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
([(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,1)],2)
=> 2
([(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,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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,1)],2)
=> 2
([(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)
=> 1
([],5)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(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,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(1,4),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(1,4),(2,3)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,4),(2,3),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(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)
=> 6
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
Description
The chromatic number of a graph. The minimal number of colors needed to color the vertices of the graph such that no two vertices which share an edge have the same color.
Mp00251: Graphs clique sizesInteger partitions
Mp00044: Integer partitions conjugateInteger partitions
St000147: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> [1]
=> [1]
=> 1
([],2)
=> [1,1]
=> [2]
=> 2
([(0,1)],2)
=> [2]
=> [1,1]
=> 1
([],3)
=> [1,1,1]
=> [3]
=> 3
([(1,2)],3)
=> [2,1]
=> [2,1]
=> 2
([(0,2),(1,2)],3)
=> [2,2]
=> [2,2]
=> 2
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,1,1]
=> 1
([],4)
=> [1,1,1,1]
=> [4]
=> 4
([(2,3)],4)
=> [2,1,1]
=> [3,1]
=> 3
([(1,3),(2,3)],4)
=> [2,2,1]
=> [3,2]
=> 3
([(0,3),(1,3),(2,3)],4)
=> [2,2,2]
=> [3,3]
=> 3
([(0,3),(1,2)],4)
=> [2,2]
=> [2,2]
=> 2
([(0,3),(1,2),(2,3)],4)
=> [2,2,2]
=> [3,3]
=> 3
([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [2,1,1]
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,2]
=> [2,2,1]
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> [2,2,2,2]
=> [4,4]
=> 4
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [3,3]
=> [2,2,2]
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> 1
([],5)
=> [1,1,1,1,1]
=> [5]
=> 5
([(3,4)],5)
=> [2,1,1,1]
=> [4,1]
=> 4
([(2,4),(3,4)],5)
=> [2,2,1,1]
=> [4,2]
=> 4
([(1,4),(2,4),(3,4)],5)
=> [2,2,2,1]
=> [4,3]
=> 4
([(0,4),(1,4),(2,4),(3,4)],5)
=> [2,2,2,2]
=> [4,4]
=> 4
([(1,4),(2,3)],5)
=> [2,2,1]
=> [3,2]
=> 3
([(1,4),(2,3),(3,4)],5)
=> [2,2,2,1]
=> [4,3]
=> 4
([(0,1),(2,4),(3,4)],5)
=> [2,2,2]
=> [3,3]
=> 3
([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [3,1,1]
=> 3
([(0,4),(1,4),(2,3),(3,4)],5)
=> [2,2,2,2]
=> [4,4]
=> 4
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,2,1]
=> [3,2,1]
=> 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,2,2]
=> [3,3,1]
=> 3
([(1,3),(1,4),(2,3),(2,4)],5)
=> [2,2,2,2,1]
=> [5,4]
=> 5
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [2,2,2,2,2]
=> [5,5]
=> 5
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,3,1]
=> [3,2,2]
=> 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,2,2]
=> [3,3,1]
=> 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,3,2]
=> [3,3,2]
=> 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [2,2,2,2,2,2]
=> [6,6]
=> 6
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,3,3]
=> [3,3,3]
=> 3
([(0,4),(1,3),(2,3),(2,4)],5)
=> [2,2,2,2]
=> [4,4]
=> 4
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,2]
=> [2,2,1]
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,2,2]
=> [3,3,1]
=> 3
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [2,2,2]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [2,2,2,2,2]
=> [5,5]
=> 5
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,2,2,2]
=> [4,4,1]
=> 4
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,3,3]
=> [3,3,3]
=> 3
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,3,2]
=> [3,3,2]
=> 3
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,2]
=> [2,2,1,1]
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,3]
=> [2,2,2,1]
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [3,3,2,2]
=> [4,4,2]
=> 4
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [3,3,3,3]
=> [4,4,4]
=> 4
Description
The largest part of an integer partition.
Mp00250: Graphs clique graphGraphs
Mp00203: Graphs coneGraphs
St000171: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> ([(0,1)],2)
=> 1
([],2)
=> ([],2)
=> ([(0,2),(1,2)],3)
=> 2
([(0,1)],2)
=> ([],1)
=> ([(0,1)],2)
=> 1
([],3)
=> ([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> 3
([(1,2)],3)
=> ([],2)
=> ([(0,2),(1,2)],3)
=> 2
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> ([(0,1)],2)
=> 1
([],4)
=> ([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 4
([(2,3)],4)
=> ([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> 3
([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2)],4)
=> ([],2)
=> ([(0,2),(1,2)],3)
=> 2
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> ([(0,2),(1,2)],3)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([(0,2),(0,3),(1,2),(1,3)],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,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([(0,1)],2)
=> 1
([],5)
=> ([],5)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 5
([(3,4)],5)
=> ([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 4
([(2,4),(3,4)],5)
=> ([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(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)
=> ([(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
([(1,4),(2,3)],5)
=> ([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> 3
([(1,4),(2,3),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,1),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> 3
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(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
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(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)
=> 5
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(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)
=> 5
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,5),(2,6),(3,4),(3,6),(4,6),(5,6)],7)
=> 6
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([(0,2),(1,2)],3)
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(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)
=> 5
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(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,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(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),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(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
Description
The degree of the graph. This is the maximal vertex degree of a graph.
Matching statistic: St000172
Mp00203: Graphs coneGraphs
Mp00250: Graphs clique graphGraphs
St000172: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([(0,1)],2)
=> ([],1)
=> 1
([],2)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> 1
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 1
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(0,3),(1,2)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
([(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,1)],2)
=> 2
([(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,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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,1)],2)
=> 2
([(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)
=> 1
([],5)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(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,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(1,4),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(1,4),(2,3)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,4),(2,3),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(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)
=> 6
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
Description
The Grundy number of a graph. The Grundy number $\Gamma(G)$ is defined to be the largest $k$ such that $G$ admits a greedy $k$-coloring. Any order of the vertices of $G$ induces a greedy coloring by assigning to the $i$-th vertex in this order the smallest positive integer such that the partial coloring remains a proper coloring. In particular, we have that $\chi(G) \leq \Gamma(G) \leq \Delta(G) + 1$, where $\chi(G)$ is the chromatic number of $G$ ([[St000098]]), and where $\Delta(G)$ is the maximal degree of a vertex of $G$ ([[St000171]]).
Mp00250: Graphs clique graphGraphs
Mp00037: Graphs to partition of connected componentsInteger partitions
St000228: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> [1]
=> 1
([],2)
=> ([],2)
=> [1,1]
=> 2
([(0,1)],2)
=> ([],1)
=> [1]
=> 1
([],3)
=> ([],3)
=> [1,1,1]
=> 3
([(1,2)],3)
=> ([],2)
=> [1,1]
=> 2
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> [2]
=> 2
([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> [1]
=> 1
([],4)
=> ([],4)
=> [1,1,1,1]
=> 4
([(2,3)],4)
=> ([],3)
=> [1,1,1]
=> 3
([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> [2,1]
=> 3
([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 3
([(0,3),(1,2)],4)
=> ([],2)
=> [1,1]
=> 2
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> [3]
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> [1,1]
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> [2]
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> 4
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> [2]
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> [1]
=> 1
([],5)
=> ([],5)
=> [1,1,1,1,1]
=> 5
([(3,4)],5)
=> ([],4)
=> [1,1,1,1]
=> 4
([(2,4),(3,4)],5)
=> ([(2,3)],4)
=> [2,1,1]
=> 4
([(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> 4
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 4
([(1,4),(2,3)],5)
=> ([],3)
=> [1,1,1]
=> 3
([(1,4),(2,3),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> [3,1]
=> 4
([(0,1),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> [2,1]
=> 3
([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> [1,1,1]
=> 3
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 4
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> [2,1]
=> 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 3
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> [4,1]
=> 5
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> 5
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> [2,1]
=> 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> [3]
=> 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> [6]
=> 6
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 3
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> [4]
=> 4
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> [1,1]
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> [3]
=> 3
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> [2]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> 5
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> 4
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 3
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> [3]
=> 3
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> [1,1]
=> 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> [2]
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> [2]
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> 4
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 4
Description
The size of a partition. This statistic is the constant statistic of the level sets.
Matching statistic: St000286
Mp00203: Graphs coneGraphs
Mp00250: Graphs clique graphGraphs
St000286: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([(0,1)],2)
=> ([],1)
=> 1
([],2)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> 1
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 1
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(0,3),(1,2)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2
([(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,1)],2)
=> 2
([(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,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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,1)],2)
=> 2
([(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)
=> 1
([],5)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(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,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(1,4),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(1,4),(2,3)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,4),(2,3),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(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)
=> 6
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1)],2)
=> 2
([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
Description
The number of connected components of the complement of a graph. The complement of a graph is the graph on the same vertex set with complementary edges.
The following 167 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000288The number of ones in a binary word. St000363The number of minimal vertex covers of a graph. St000378The diagonal inversion number of an integer partition. St000459The hook length of the base cell of a partition. St000460The hook length of the last cell along the main diagonal of an integer partition. St000469The distinguishing number of a graph. St000636The hull number of a graph. St000722The number of different neighbourhoods in a graph. St000822The Hadwiger number of the graph. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000926The clique-coclique number of a graph. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001029The size of the core of a graph. St001108The 2-dynamic chromatic number of a graph. St001110The 3-dynamic chromatic number of a graph. St001116The game chromatic number of a graph. St001302The number of minimally dominating sets of vertices of a graph. St001316The domatic number of a graph. St001330The hat guessing number of a graph. St001342The number of vertices in the center of a graph. St001366The maximal multiplicity of a degree of a vertex of a graph. St001368The number of vertices of maximal degree in a graph. St001391The disjunction number of a graph. St001494The Alon-Tarsi number of a graph. St001580The acyclic chromatic number of a graph. St001581The achromatic number of a graph. St001645The pebbling number of a connected graph. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St001670The connected partition number of a graph. St001707The length of a longest path in a graph such that the remaining vertices can be partitioned into two sets of the same size without edges between them. St001725The harmonious chromatic number of a graph. St001746The coalition number of a graph. St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St001883The mutual visibility number of a graph. St001963The tree-depth of a graph. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000272The treewidth of a graph. St000300The number of independent sets of vertices of a graph. St000301The number of facets of the stable set polytope of a graph. St000310The minimal degree of a vertex of a graph. St000362The size of a minimal vertex cover of a graph. St000454The largest eigenvalue of a graph if it is integral. St000536The pathwidth of a graph. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000741The Colin de Verdière graph invariant. St000778The metric dimension of a graph. St001119The length of a shortest maximal path in a graph. St001120The length of a longest path in a graph. St001270The bandwidth of a graph. St001277The degeneracy of a graph. St001357The maximal degree of a regular spanning subgraph of a graph. St001358The largest degree of a regular subgraph of a graph. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St001644The dimension of a graph. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001949The rigidity index of a graph. St001962The proper pathwidth of a graph. St000676The number of odd rises of a Dyck path. St000734The last entry in the first row of a standard tableau. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St000053The number of valleys of the Dyck path. St001345The Hamming dimension of a graph. St000146The Andrews-Garvan crank of a partition. St000733The row containing the largest entry of a standard tableau. St001280The number of parts of an integer partition that are at least two. St000157The number of descents of a standard tableau. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St001812The biclique partition number of a graph. St000015The number of peaks of a Dyck path. St000443The number of long tunnels of a Dyck path. St000507The number of ascents of a standard tableau. 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. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St000331The number of upper interactions of a Dyck path. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001480The number of simple summands of the module J^2/J^3. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St000473The number of parts of a partition that are strictly bigger than the number of ones. St001462The number of factors of a standard tableaux under concatenation. St001352The number of internal nodes in the modular decomposition of a graph. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St000259The diameter of a connected graph. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. 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$. 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$. St001613The binary logarithm of the size of the center of a lattice. St001617The dimension of the space of valuations of a lattice. St000455The second largest eigenvalue of a graph if it is integral. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000014The number of parking functions supported by a Dyck path. St000063The number of linear extensions of a certain poset defined for an integer partition. St000108The number of partitions contained in the given partition. St000144The pyramid weight of the Dyck path. St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. St000393The number of strictly increasing runs in a binary word. St000395The sum of the heights of the peaks of a Dyck path. St000420The number of Dyck paths that are weakly above a Dyck path. St000532The total number of rook placements on a Ferrers board. St000998Number of indecomposable projective modules with injective dimension smaller than or equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St001018Sum of projective dimension of the indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001020Sum of the codominant dimensions of the non-projective indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001023Number of simple modules with projective dimension at most 3 in the Nakayama algebra corresponding to the Dyck path. St001065Number of indecomposable reflexive modules in the corresponding Nakayama algebra. St001166Number of indecomposable projective non-injective modules with dominant dimension equal to the global dimension plus the number of indecomposable projective injective modules in the corresponding Nakayama algebra. St001170Number of indecomposable injective modules whose socle has projective dimension at most g-1 when g denotes the global dimension in the corresponding Nakayama algebra. St001179Number of indecomposable injective modules with projective dimension at most 2 in the corresponding Nakayama algebra. St001180Number of indecomposable injective modules with projective dimension at most 1. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001190Number of simple modules with projective dimension at most 4 in the corresponding Nakayama algebra. St001211The number of simple modules in the corresponding Nakayama algebra that have vanishing second Ext-group with the regular module. St001237The number of simple modules with injective dimension at most one or dominant dimension at least one. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001267The length of the Lyndon factorization of the binary word. St001400The total number of Littlewood-Richardson tableaux of given shape. St001437The flex of a binary word. St001492The number of simple modules that do not appear in the socle of the regular module or have no nontrivial selfextensions with the regular module in the corresponding Nakayama algebra. St001650The order of Ringel's homological bijection associated to the linear Nakayama algebra corresponding to the Dyck path. St001658The total number of rook placements on a Ferrers board. St001060The distinguishing index of a graph. St000264The girth of a graph, which is not a tree. St001621The number of atoms of a lattice. St001624The breadth of a lattice. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001712The number of natural descents of a standard Young tableau. 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. St000910The number of maximal chains of minimal length in a poset. St000993The multiplicity of the largest part of an integer partition. St001668The number of points of the poset minus the width of the poset. 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. St000815The number of semistandard Young tableaux of partition weight of given shape. St000933The number of multipartitions of sizes given by an integer partition. St000438The position of the last up step in a Dyck path. St000514The number of invariant simple graphs when acting with a permutation of given cycle type. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St000981The length of the longest zigzag subpath. St000422The energy of a graph, if it is integral. St001875The number of simple modules with projective dimension at most 1. St000260The radius of a connected graph. St001651The Frankl number of a lattice. 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. St000302The determinant of the distance matrix of a connected graph. St000466The Gutman (or modified Schultz) index of a connected graph. St000467The hyper-Wiener index of a connected graph.