- FindStat

Your data matches 91 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)

Matching statistic: St000387
(load all 8 compositions to match this statistic)

Mapping

St000387: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([],1)
 => 0
([],2)
 => 0
([(0,1)],2)
 => 1
([],3)
 => 0
([(1,2)],3)
 => 1
([(0,2),(1,2)],3)
 => 1
([(0,1),(0,2),(1,2)],3)
 => 1
([],4)
 => 0
([(2,3)],4)
 => 1
([(1,3),(2,3)],4)
 => 1
([(0,3),(1,3),(2,3)],4)
 => 1
([(0,3),(1,2)],4)
 => 2
([(0,3),(1,2),(2,3)],4)
 => 2
([(1,2),(1,3),(2,3)],4)
 => 1
([(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)
 => 2
([],5)
 => 0
([(3,4)],5)
 => 1
([(2,4),(3,4)],5)
 => 1
([(1,4),(2,4),(3,4)],5)
 => 1
([(0,4),(1,4),(2,4),(3,4)],5)
 => 1
([(1,4),(2,3)],5)
 => 2
([(1,4),(2,3),(3,4)],5)
 => 2
([(0,1),(2,4),(3,4)],5)
 => 2
([(2,3),(2,4),(3,4)],5)
 => 1
([(0,4),(1,4),(2,3),(3,4)],5)
 => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
([(1,3),(1,4),(2,3),(2,4)],5)
 => 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
([(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)
 => 2
([(0,4),(1,3),(2,3),(2,4)],5)
 => 2
([(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 matching number of a graph. For a graph

$G$ , this is defined as the maximal size of a '''matching''' or '''independent edge set''' (a set of edges without common vertices) contained in

$G$ .

Matching statistic: St000093
(load all 3 compositions to match this statistic)

Mapping

Mp00156: Graphs —line graph⟶ Graphs
St000093: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([],1)
 => ([],0)
 => 0
([],2)
 => ([],0)
 => 0
([(0,1)],2)
 => ([],1)
 => 1
([],3)
 => ([],0)
 => 0
([(1,2)],3)
 => ([],1)
 => 1
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1
([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1
([],4)
 => ([],0)
 => 0
([(2,3)],4)
 => ([],1)
 => 1
([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 1
([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1
([(0,3),(1,2)],4)
 => ([],2)
 => 2
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 2
([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => 2
([],5)
 => ([],0)
 => 0
([(3,4)],5)
 => ([],1)
 => 1
([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 1
([(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1
([(1,4),(2,3)],5)
 => ([],2)
 => 2
([(1,4),(2,3),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => 2
([(0,1),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => 2
([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1
([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
([(0,4),(1,3),(1,4),(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)
 => 2
([(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)
 => 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(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)
 => 2
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 2
([(0,1),(2,3),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(2,3)],4)
 => 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 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,3),(0,4),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(0,6),(1,2),(1,4),(1,5),(2,3),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => 2
([(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),(3,4),(3,5),(4,5)],6)
 => 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
 => 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,5),(1,6),(1,7),(2,3),(2,4),(2,7),(3,4),(3,6),(3,7),(4,5),(4,7),(5,6),(5,7),(6,7)],8)
 => 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(0,5),(0,6),(1,3),(1,4),(2,3),(2,4),(2,5),(2,6),(3,4),(3,6),(4,5),(5,6)],7)
 => 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(0,3),(0,6),(0,7),(1,2),(1,3),(1,4),(1,5),(2,5),(2,7),(3,4),(3,6),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
 => 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: St000097
(load all 3 compositions to match this statistic)

Mapping

Mp00156: Graphs —line graph⟶ Graphs
Mp00111: Graphs —complement⟶ Graphs
St000097: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([],1)
 => ([],0)
 => ([],0)
 => 0
([],2)
 => ([],0)
 => ([],0)
 => 0
([(0,1)],2)
 => ([],1)
 => ([],1)
 => 1
([],3)
 => ([],0)
 => ([],0)
 => 0
([(1,2)],3)
 => ([],1)
 => ([],1)
 => 1
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([],2)
 => 1
([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 1
([],4)
 => ([],0)
 => ([],0)
 => 0
([(2,3)],4)
 => ([],1)
 => ([],1)
 => 1
([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([],2)
 => 1
([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 1
([(0,3),(1,2)],4)
 => ([],2)
 => ([(0,1)],2)
 => 2
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => 2
([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(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)
 => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(1,4),(2,3)],5)
 => 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,5),(1,4),(2,3)],6)
 => 2
([],5)
 => ([],0)
 => ([],0)
 => 0
([(3,4)],5)
 => ([],1)
 => ([],1)
 => 1
([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 1
([(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 1
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([],4)
 => 1
([(1,4),(2,3)],5)
 => ([],2)
 => ([(0,1)],2)
 => 2
([(1,4),(2,3),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => 2
([(0,1),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 1
([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(1,3),(2,3)],4)
 => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(2,4),(3,4)],5)
 => 2
([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,3),(1,2)],4)
 => 2
([(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,4),(1,3),(2,3),(2,4)],5)
 => 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(1,4),(2,3)],5)
 => 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(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,3),(1,4),(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,5),(2,4),(3,4),(3,5)],6)
 => 2
([(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,4),(0,5),(1,2),(1,3),(2,5),(3,4)],6)
 => 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(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)
 => ([(1,5),(1,6),(2,3),(2,4),(3,6),(4,5)],7)
 => 2
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,3),(1,2),(2,3)],4)
 => 2
([(0,1),(2,3),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => 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),(1,2),(1,4),(2,3)],5)
 => 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
 => 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(0,6),(1,2),(1,4),(1,5),(2,3),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6),(5,6)],7)
 => 2
([(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),(3,4),(3,5),(4,5)],6)
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,5),(1,4),(2,3)],6)
 => 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
 => ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
 => 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,5),(1,6),(1,7),(2,3),(2,4),(2,7),(3,4),(3,6),(3,7),(4,5),(4,7),(5,6),(5,7),(6,7)],8)
 => ([(0,7),(1,4),(1,6),(2,3),(2,6),(3,5),(4,5),(5,7),(6,7)],8)
 => 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(0,5),(0,6),(1,3),(1,4),(2,3),(2,4),(2,5),(2,6),(3,4),(3,6),(4,5),(5,6)],7)
 => ([(0,3),(0,6),(1,2),(1,6),(2,5),(3,5),(4,5),(4,6)],7)
 => 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(0,3),(0,6),(0,7),(1,2),(1,3),(1,4),(1,5),(2,5),(2,7),(3,4),(3,6),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
 => ([(0,6),(0,7),(1,4),(1,5),(2,5),(2,7),(3,4),(3,6),(4,7),(5,6)],8)
 => 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: St000875
(load all 2 compositions to match this statistic)

Mapping

Mp00324: Graphs —chromatic difference sequence⟶ Integer compositions
Mp00038: Integer compositions —reverse⟶ Integer compositions
Mp00094: Integer compositions —to binary word⟶ Binary words
St000875: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([],1)
 => [1] => [1] => 1 => 0
([],2)
 => [2] => [2] => 10 => 1
([(0,1)],2)
 => [1,1] => [1,1] => 11 => 0
([],3)
 => [3] => [3] => 100 => 1
([(1,2)],3)
 => [2,1] => [1,2] => 110 => 1
([(0,2),(1,2)],3)
 => [2,1] => [1,2] => 110 => 1
([(0,1),(0,2),(1,2)],3)
 => [1,1,1] => [1,1,1] => 111 => 0
([],4)
 => [4] => [4] => 1000 => 1
([(2,3)],4)
 => [3,1] => [1,3] => 1100 => 2
([(1,3),(2,3)],4)
 => [3,1] => [1,3] => 1100 => 2
([(0,3),(1,3),(2,3)],4)
 => [3,1] => [1,3] => 1100 => 2
([(0,3),(1,2)],4)
 => [2,2] => [2,2] => 1010 => 2
([(0,3),(1,2),(2,3)],4)
 => [2,2] => [2,2] => 1010 => 2
([(1,2),(1,3),(2,3)],4)
 => [2,1,1] => [1,1,2] => 1110 => 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => [2,1,1] => [1,1,2] => 1110 => 1
([(0,2),(0,3),(1,2),(1,3)],4)
 => [2,2] => [2,2] => 1010 => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => [2,1,1] => [1,1,2] => 1110 => 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => [1,1,1,1] => [1,1,1,1] => 1111 => 0
([],5)
 => [5] => [5] => 10000 => 1
([(3,4)],5)
 => [4,1] => [1,4] => 11000 => 2
([(2,4),(3,4)],5)
 => [4,1] => [1,4] => 11000 => 2
([(1,4),(2,4),(3,4)],5)
 => [4,1] => [1,4] => 11000 => 2
([(0,4),(1,4),(2,4),(3,4)],5)
 => [4,1] => [1,4] => 11000 => 2
([(1,4),(2,3)],5)
 => [3,2] => [2,3] => 10100 => 2
([(1,4),(2,3),(3,4)],5)
 => [3,2] => [2,3] => 10100 => 2
([(0,1),(2,4),(3,4)],5)
 => [3,2] => [2,3] => 10100 => 2
([(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,1,3] => 11100 => 2
([(0,4),(1,4),(2,3),(3,4)],5)
 => [3,2] => [2,3] => 10100 => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,1,3] => 11100 => 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,1,3] => 11100 => 2
([(1,3),(1,4),(2,3),(2,4)],5)
 => [3,2] => [2,3] => 10100 => 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => [3,2] => [2,3] => 10100 => 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,1,3] => 11100 => 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,1,3] => 11100 => 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,1,3] => 11100 => 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => [3,2] => [2,3] => 10100 => 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,1,3] => 11100 => 2
([(0,4),(1,3),(2,3),(2,4)],5)
 => [3,2] => [2,3] => 10100 => 2
([(0,1),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,1,1,1] => [1,1,1,2] => 11110 => 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,1,1,1] => [1,1,1,2] => 11110 => 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,1,1,1] => [1,1,1,2] => 11110 => 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2

Description

The semilength of the longest Dyck word in the Catalan factorisation of a binary word. Every binary word can be written in a unique way as

$(\mathcal D 0)^\ell \mathcal D (1 \mathcal D)^m$ , where

$\mathcal D$ is the set of Dyck words. This is the Catalan factorisation, see [1, sec.9.1.2]. This statistic records the semilength of the longest Dyck word in this factorisation.

Matching statistic: St001420
(load all 3 compositions to match this statistic)

Mapping

Mp00324: Graphs —chromatic difference sequence⟶ Integer compositions
Mp00038: Integer compositions —reverse⟶ Integer compositions
Mp00094: Integer compositions —to binary word⟶ Binary words
St001420: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([],1)
 => [1] => [1] => 1 => 0
([],2)
 => [2] => [2] => 10 => 1
([(0,1)],2)
 => [1,1] => [1,1] => 11 => 0
([],3)
 => [3] => [3] => 100 => 1
([(1,2)],3)
 => [2,1] => [1,2] => 110 => 1
([(0,2),(1,2)],3)
 => [2,1] => [1,2] => 110 => 1
([(0,1),(0,2),(1,2)],3)
 => [1,1,1] => [1,1,1] => 111 => 0
([],4)
 => [4] => [4] => 1000 => 1
([(2,3)],4)
 => [3,1] => [1,3] => 1100 => 2
([(1,3),(2,3)],4)
 => [3,1] => [1,3] => 1100 => 2
([(0,3),(1,3),(2,3)],4)
 => [3,1] => [1,3] => 1100 => 2
([(0,3),(1,2)],4)
 => [2,2] => [2,2] => 1010 => 2
([(0,3),(1,2),(2,3)],4)
 => [2,2] => [2,2] => 1010 => 2
([(1,2),(1,3),(2,3)],4)
 => [2,1,1] => [1,1,2] => 1110 => 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => [2,1,1] => [1,1,2] => 1110 => 1
([(0,2),(0,3),(1,2),(1,3)],4)
 => [2,2] => [2,2] => 1010 => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => [2,1,1] => [1,1,2] => 1110 => 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => [1,1,1,1] => [1,1,1,1] => 1111 => 0
([],5)
 => [5] => [5] => 10000 => 1
([(3,4)],5)
 => [4,1] => [1,4] => 11000 => 2
([(2,4),(3,4)],5)
 => [4,1] => [1,4] => 11000 => 2
([(1,4),(2,4),(3,4)],5)
 => [4,1] => [1,4] => 11000 => 2
([(0,4),(1,4),(2,4),(3,4)],5)
 => [4,1] => [1,4] => 11000 => 2
([(1,4),(2,3)],5)
 => [3,2] => [2,3] => 10100 => 2
([(1,4),(2,3),(3,4)],5)
 => [3,2] => [2,3] => 10100 => 2
([(0,1),(2,4),(3,4)],5)
 => [3,2] => [2,3] => 10100 => 2
([(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,1,3] => 11100 => 2
([(0,4),(1,4),(2,3),(3,4)],5)
 => [3,2] => [2,3] => 10100 => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,1,3] => 11100 => 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,1,3] => 11100 => 2
([(1,3),(1,4),(2,3),(2,4)],5)
 => [3,2] => [2,3] => 10100 => 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => [3,2] => [2,3] => 10100 => 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,1,3] => 11100 => 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,1,3] => 11100 => 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,1,3] => 11100 => 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => [3,2] => [2,3] => 10100 => 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,1,3] => 11100 => 2
([(0,4),(1,3),(2,3),(2,4)],5)
 => [3,2] => [2,3] => 10100 => 2
([(0,1),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,1,1,1] => [1,1,1,2] => 11110 => 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,1,1,1] => [1,1,1,2] => 11110 => 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,1,1,1] => [1,1,1,2] => 11110 => 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2

Description

Half the length of a longest factor which is its own reverse-complement of a binary word.

Matching statistic: St001421
(load all 2 compositions to match this statistic)

Mapping

Mp00324: Graphs —chromatic difference sequence⟶ Integer compositions
Mp00038: Integer compositions —reverse⟶ Integer compositions
Mp00094: Integer compositions —to binary word⟶ Binary words
St001421: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([],1)
 => [1] => [1] => 1 => 0
([],2)
 => [2] => [2] => 10 => 1
([(0,1)],2)
 => [1,1] => [1,1] => 11 => 0
([],3)
 => [3] => [3] => 100 => 1
([(1,2)],3)
 => [2,1] => [1,2] => 110 => 1
([(0,2),(1,2)],3)
 => [2,1] => [1,2] => 110 => 1
([(0,1),(0,2),(1,2)],3)
 => [1,1,1] => [1,1,1] => 111 => 0
([],4)
 => [4] => [4] => 1000 => 1
([(2,3)],4)
 => [3,1] => [1,3] => 1100 => 2
([(1,3),(2,3)],4)
 => [3,1] => [1,3] => 1100 => 2
([(0,3),(1,3),(2,3)],4)
 => [3,1] => [1,3] => 1100 => 2
([(0,3),(1,2)],4)
 => [2,2] => [2,2] => 1010 => 2
([(0,3),(1,2),(2,3)],4)
 => [2,2] => [2,2] => 1010 => 2
([(1,2),(1,3),(2,3)],4)
 => [2,1,1] => [1,1,2] => 1110 => 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => [2,1,1] => [1,1,2] => 1110 => 1
([(0,2),(0,3),(1,2),(1,3)],4)
 => [2,2] => [2,2] => 1010 => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => [2,1,1] => [1,1,2] => 1110 => 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => [1,1,1,1] => [1,1,1,1] => 1111 => 0
([],5)
 => [5] => [5] => 10000 => 1
([(3,4)],5)
 => [4,1] => [1,4] => 11000 => 2
([(2,4),(3,4)],5)
 => [4,1] => [1,4] => 11000 => 2
([(1,4),(2,4),(3,4)],5)
 => [4,1] => [1,4] => 11000 => 2
([(0,4),(1,4),(2,4),(3,4)],5)
 => [4,1] => [1,4] => 11000 => 2
([(1,4),(2,3)],5)
 => [3,2] => [2,3] => 10100 => 2
([(1,4),(2,3),(3,4)],5)
 => [3,2] => [2,3] => 10100 => 2
([(0,1),(2,4),(3,4)],5)
 => [3,2] => [2,3] => 10100 => 2
([(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,1,3] => 11100 => 2
([(0,4),(1,4),(2,3),(3,4)],5)
 => [3,2] => [2,3] => 10100 => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,1,3] => 11100 => 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,1,3] => 11100 => 2
([(1,3),(1,4),(2,3),(2,4)],5)
 => [3,2] => [2,3] => 10100 => 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => [3,2] => [2,3] => 10100 => 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,1,3] => 11100 => 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,1,3] => 11100 => 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,1,3] => 11100 => 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => [3,2] => [2,3] => 10100 => 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,1,3] => 11100 => 2
([(0,4),(1,3),(2,3),(2,4)],5)
 => [3,2] => [2,3] => 10100 => 2
([(0,1),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,1,1,1] => [1,1,1,2] => 11110 => 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,1,1,1] => [1,1,1,2] => 11110 => 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,1,1,1] => [1,1,1,2] => 11110 => 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => 11010 => 2

Description

Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word.

Matching statistic: St001093

Mapping

Mp00324: Graphs —chromatic difference sequence⟶ Integer compositions
Mp00172: Integer compositions —rotate back to front⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St001093: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([],1)
 => [1] => [1] => ([],1)
 => 1 = 0 + 1
([],2)
 => [2] => [2] => ([],2)
 => 1 = 0 + 1
([(0,1)],2)
 => [1,1] => [1,1] => ([(0,1)],2)
 => 2 = 1 + 1
([],3)
 => [3] => [3] => ([],3)
 => 1 = 0 + 1
([(1,2)],3)
 => [2,1] => [1,2] => ([(1,2)],3)
 => 2 = 1 + 1
([(0,2),(1,2)],3)
 => [2,1] => [1,2] => ([(1,2)],3)
 => 2 = 1 + 1
([(0,1),(0,2),(1,2)],3)
 => [1,1,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
 => 2 = 1 + 1
([],4)
 => [4] => [4] => ([],4)
 => 1 = 0 + 1
([(2,3)],4)
 => [3,1] => [1,3] => ([(2,3)],4)
 => 2 = 1 + 1
([(1,3),(2,3)],4)
 => [3,1] => [1,3] => ([(2,3)],4)
 => 2 = 1 + 1
([(0,3),(1,3),(2,3)],4)
 => [3,1] => [1,3] => ([(2,3)],4)
 => 2 = 1 + 1
([(0,3),(1,2)],4)
 => [2,2] => [2,2] => ([(1,3),(2,3)],4)
 => 3 = 2 + 1
([(0,3),(1,2),(2,3)],4)
 => [2,2] => [2,2] => ([(1,3),(2,3)],4)
 => 3 = 2 + 1
([(1,2),(1,3),(2,3)],4)
 => [2,1,1] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 2 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => [2,1,1] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 2 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
 => [2,2] => [2,2] => ([(1,3),(2,3)],4)
 => 3 = 2 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => [2,1,1] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 2 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => [1,1,1,1] => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2 = 1 + 1
([],5)
 => [5] => [5] => ([],5)
 => 1 = 0 + 1
([(3,4)],5)
 => [4,1] => [1,4] => ([(3,4)],5)
 => 2 = 1 + 1
([(2,4),(3,4)],5)
 => [4,1] => [1,4] => ([(3,4)],5)
 => 2 = 1 + 1
([(1,4),(2,4),(3,4)],5)
 => [4,1] => [1,4] => ([(3,4)],5)
 => 2 = 1 + 1
([(0,4),(1,4),(2,4),(3,4)],5)
 => [4,1] => [1,4] => ([(3,4)],5)
 => 2 = 1 + 1
([(1,4),(2,3)],5)
 => [3,2] => [2,3] => ([(2,4),(3,4)],5)
 => 3 = 2 + 1
([(1,4),(2,3),(3,4)],5)
 => [3,2] => [2,3] => ([(2,4),(3,4)],5)
 => 3 = 2 + 1
([(0,1),(2,4),(3,4)],5)
 => [3,2] => [2,3] => ([(2,4),(3,4)],5)
 => 3 = 2 + 1
([(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 2 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
 => [3,2] => [2,3] => ([(2,4),(3,4)],5)
 => 3 = 2 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 2 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 2 + 1
([(1,3),(1,4),(2,3),(2,4)],5)
 => [3,2] => [2,3] => ([(2,4),(3,4)],5)
 => 3 = 2 + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => [3,2] => [2,3] => ([(2,4),(3,4)],5)
 => 3 = 2 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 2 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 2 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 2 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => [3,2] => [2,3] => ([(2,4),(3,4)],5)
 => 3 = 2 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 2 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
 => [3,2] => [2,3] => ([(2,4),(3,4)],5)
 => 3 = 2 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 2 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 2 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 2 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => [2,2,1] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 2 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 2 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 2 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 2 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,1,1,1] => [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 2 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,1,1,1] => [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 2 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,1,1,1] => [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 2 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => [2,2,1] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 2 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => [2,2,1] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 2 + 1

Description

The detour number of a graph. This is the number of vertices in a longest induced path in a graph. Note that [1] defines the detour number as the number of edges in a longest induced path, which is unsuitable for the empty graph.

Matching statistic: St000786
(load all 3 compositions to match this statistic)

Mapping

Mp00156: Graphs —line graph⟶ Graphs
St000786: Graphs ⟶ ℤResult quality: 67% ●values known / values provided: 90%●distinct values known / distinct values provided: 67%

Values

([],1)
 => ([],0)
 => ? = 0
([],2)
 => ([],0)
 => ? = 0
([(0,1)],2)
 => ([],1)
 => 1
([],3)
 => ([],0)
 => ? = 0
([(1,2)],3)
 => ([],1)
 => 1
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1
([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1
([],4)
 => ([],0)
 => ? = 0
([(2,3)],4)
 => ([],1)
 => 1
([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 1
([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1
([(0,3),(1,2)],4)
 => ([],2)
 => 2
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 2
([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => 2
([],5)
 => ([],0)
 => ? = 0
([(3,4)],5)
 => ([],1)
 => 1
([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 1
([(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1
([(1,4),(2,3)],5)
 => ([],2)
 => 2
([(1,4),(2,3),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => 2
([(0,1),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => 2
([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1
([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
([(0,4),(1,3),(1,4),(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)
 => 2
([(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)
 => 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(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)
 => 2
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 2
([(0,1),(2,3),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(2,3)],4)
 => 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 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,3),(0,4),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(0,6),(1,2),(1,4),(1,5),(2,3),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => 2
([(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),(3,4),(3,5),(4,5)],6)
 => 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
 => 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,5),(1,6),(1,7),(2,3),(2,4),(2,7),(3,4),(3,6),(3,7),(4,5),(4,7),(5,6),(5,7),(6,7)],8)
 => 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(0,5),(0,6),(1,3),(1,4),(2,3),(2,4),(2,5),(2,6),(3,4),(3,6),(4,5),(5,6)],7)
 => 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(0,3),(0,6),(0,7),(1,2),(1,3),(1,4),(1,5),(2,5),(2,7),(3,4),(3,6),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
 => 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,4),(0,5),(0,7),(0,8),(1,2),(1,3),(1,7),(1,8),(2,3),(2,5),(2,6),(2,8),(3,4),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,8),(6,7),(6,8),(7,8)],9)
 => 2
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(0,5),(0,6),(0,7),(0,8),(0,9),(1,2),(1,3),(1,6),(1,7),(1,8),(1,9),(2,3),(2,4),(2,5),(2,8),(2,9),(3,4),(3,5),(3,6),(3,7),(4,5),(4,7),(4,9),(5,6),(5,8),(6,7),(6,8),(7,9),(8,9)],10)
 => 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: St000259
(load all 12 compositions to match this statistic)

Mapping

Mp00156: Graphs —line graph⟶ Graphs
Mp00203: Graphs —cone⟶ Graphs
St000259: Graphs ⟶ ℤResult quality: 85% ●values known / values provided: 85%●distinct values known / distinct values provided: 100%

Values

([],1)
 => ([],0)
 => ([],1)
 => 0
([],2)
 => ([],0)
 => ([],1)
 => 0
([(0,1)],2)
 => ([],1)
 => ([(0,1)],2)
 => 1
([],3)
 => ([],0)
 => ([],1)
 => 0
([(1,2)],3)
 => ([],1)
 => ([(0,1)],2)
 => 1
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1),(0,2),(1,2)],3)
 => 1
([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1
([],4)
 => ([],0)
 => ([],1)
 => 0
([(2,3)],4)
 => ([],1)
 => ([(0,1)],2)
 => 1
([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1),(0,2),(1,2)],3)
 => 1
([(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)
 => 1
([(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)
 => 2
([(1,2),(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)
 => 1
([(0,3),(1,2),(1,3),(2,3)],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)
 => 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)
 => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
 => 2
([],5)
 => ([],0)
 => ([],1)
 => 0
([(3,4)],5)
 => ([],1)
 => ([(0,1)],2)
 => 1
([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1),(0,2),(1,2)],3)
 => 1
([(1,4),(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)
 => 1
([(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)
 => 1
([(1,4),(2,3)],5)
 => ([],2)
 => ([(0,2),(1,2)],3)
 => 2
([(1,4),(2,3),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2
([(0,1),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 2
([(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)
 => 1
([(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)
 => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(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)
 => 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)
 => 2
([(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)
 => 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(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)
 => 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
([(0,4),(1,3),(1,4),(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,4),(0,5),(0,6),(1,3),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => 2
([(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)
 => 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(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)
 => ([(0,3),(0,4),(0,5),(0,6),(0,7),(1,2),(1,4),(1,5),(1,6),(1,7),(2,3),(2,5),(2,6),(2,7),(3,4),(3,6),(3,7),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
 => ? ∊ {2,2,2,2,2,2,2,2}
([(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)
 => 2
([(0,1),(2,3),(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)
 => 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(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)
 => 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => 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)
 => 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,3),(0,4),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(0,6),(1,2),(1,4),(1,5),(2,3),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,3),(0,4),(0,6),(0,7),(1,2),(1,4),(1,5),(1,7),(2,3),(2,5),(2,6),(2,7),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
 => ? ∊ {2,2,2,2,2,2,2,2}
([(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),(3,4),(3,5),(4,5)],6)
 => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
 => 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
 => ([(0,4),(0,5),(0,6),(0,7),(1,2),(1,3),(1,5),(1,6),(1,7),(2,3),(2,4),(2,6),(2,7),(3,4),(3,5),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
 => ? ∊ {2,2,2,2,2,2,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),(0,6),(1,2),(1,5),(1,6),(1,7),(2,3),(2,4),(2,7),(3,4),(3,6),(3,7),(4,5),(4,7),(5,6),(5,7),(6,7)],8)
 => ([(0,3),(0,4),(0,5),(0,6),(0,8),(1,2),(1,5),(1,6),(1,7),(1,8),(2,3),(2,4),(2,7),(2,8),(3,4),(3,6),(3,7),(3,8),(4,5),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
 => ? ∊ {2,2,2,2,2,2,2,2}
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(0,5),(0,6),(1,3),(1,4),(2,3),(2,4),(2,5),(2,6),(3,4),(3,6),(4,5),(5,6)],7)
 => ([(0,1),(0,5),(0,6),(0,7),(1,3),(1,4),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,6),(3,7),(4,5),(4,7),(5,6),(5,7),(6,7)],8)
 => ? ∊ {2,2,2,2,2,2,2,2}
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(0,3),(0,6),(0,7),(1,2),(1,3),(1,4),(1,5),(2,5),(2,7),(3,4),(3,6),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
 => ([(0,2),(0,3),(0,6),(0,7),(0,8),(1,2),(1,3),(1,4),(1,5),(1,8),(2,5),(2,7),(2,8),(3,4),(3,6),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
 => ? ∊ {2,2,2,2,2,2,2,2}
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,4),(0,5),(0,7),(0,8),(1,2),(1,3),(1,7),(1,8),(2,3),(2,5),(2,6),(2,8),(3,4),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,8),(6,7),(6,8),(7,8)],9)
 => ([(0,1),(0,4),(0,5),(0,7),(0,8),(0,9),(1,2),(1,3),(1,7),(1,8),(1,9),(2,3),(2,5),(2,6),(2,8),(2,9),(3,4),(3,6),(3,7),(3,9),(4,5),(4,6),(4,7),(4,9),(5,6),(5,8),(5,9),(6,7),(6,8),(6,9),(7,8),(7,9),(8,9)],10)
 => ? ∊ {2,2,2,2,2,2,2,2}
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(0,5),(0,6),(0,7),(0,8),(0,9),(1,2),(1,3),(1,6),(1,7),(1,8),(1,9),(2,3),(2,4),(2,5),(2,8),(2,9),(3,4),(3,5),(3,6),(3,7),(4,5),(4,7),(4,9),(5,6),(5,8),(6,7),(6,8),(7,9),(8,9)],10)
 => ([(0,4),(0,5),(0,6),(0,7),(0,8),(0,9),(0,10),(1,2),(1,3),(1,6),(1,7),(1,8),(1,9),(1,10),(2,3),(2,4),(2,5),(2,8),(2,9),(2,10),(3,4),(3,5),(3,6),(3,7),(3,10),(4,5),(4,7),(4,9),(4,10),(5,6),(5,8),(5,10),(6,7),(6,8),(6,10),(7,9),(7,10),(8,9),(8,10),(9,10)],11)
 => ? ∊ {2,2,2,2,2,2,2,2}

Description

The diameter of a connected graph. This is the greatest distance between any pair of vertices.

Matching statistic: St001674

Mapping

Mp00156: Graphs —line graph⟶ Graphs
Mp00203: Graphs —cone⟶ Graphs
St001674: Graphs ⟶ ℤResult quality: 85% ●values known / values provided: 85%●distinct values known / distinct values provided: 100%

Values

([],1)
 => ([],0)
 => ([],1)
 => 1 = 0 + 1
([],2)
 => ([],0)
 => ([],1)
 => 1 = 0 + 1
([(0,1)],2)
 => ([],1)
 => ([(0,1)],2)
 => 2 = 1 + 1
([],3)
 => ([],0)
 => ([],1)
 => 1 = 0 + 1
([(1,2)],3)
 => ([],1)
 => ([(0,1)],2)
 => 2 = 1 + 1
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 1 + 1
([(0,1),(0,2),(1,2)],3)
 => ([(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)
 => ([],1)
 => 1 = 0 + 1
([(2,3)],4)
 => ([],1)
 => ([(0,1)],2)
 => 2 = 1 + 1
([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 1 + 1
([(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)
 => 2 = 1 + 1
([(0,3),(1,2)],4)
 => ([],2)
 => ([(0,2),(1,2)],3)
 => 3 = 2 + 1
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 2 + 1
([(1,2),(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)
 => 2 = 1 + 1
([(0,3),(1,2),(1,3),(2,3)],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)
 => 3 = 2 + 1
([(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)
 => 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,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
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
 => 3 = 2 + 1
([],5)
 => ([],0)
 => ([],1)
 => 1 = 0 + 1
([(3,4)],5)
 => ([],1)
 => ([(0,1)],2)
 => 2 = 1 + 1
([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 1 + 1
([(1,4),(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)
 => 2 = 1 + 1
([(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)
 => 2 = 1 + 1
([(1,4),(2,3)],5)
 => ([],2)
 => ([(0,2),(1,2)],3)
 => 3 = 2 + 1
([(1,4),(2,3),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 2 + 1
([(0,1),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 2 + 1
([(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)
 => 2 = 1 + 1
([(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)
 => 3 = 2 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(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,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(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
([(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)
 => 3 = 2 + 1
([(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)
 => 3 = 2 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(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
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(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,3),(1,4),(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,4),(0,5),(0,6),(1,3),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => 3 = 2 + 1
([(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)
 => 3 = 2 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(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)
 => ([(0,3),(0,4),(0,5),(0,6),(0,7),(1,2),(1,4),(1,5),(1,6),(1,7),(2,3),(2,5),(2,6),(2,7),(3,4),(3,6),(3,7),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
 => ? ∊ {2,2,2,2,2,2,2,2} + 1
([(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)
 => 3 = 2 + 1
([(0,1),(2,3),(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)
 => 3 = 2 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(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
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => 3 = 2 + 1
([(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)
 => 3 = 2 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,3),(0,4),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => 3 = 2 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(0,6),(1,2),(1,4),(1,5),(2,3),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,3),(0,4),(0,6),(0,7),(1,2),(1,4),(1,5),(1,7),(2,3),(2,5),(2,6),(2,7),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
 => ? ∊ {2,2,2,2,2,2,2,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),(3,4),(3,5),(4,5)],6)
 => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => 3 = 2 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
 => 3 = 2 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
 => ([(0,4),(0,5),(0,6),(0,7),(1,2),(1,3),(1,5),(1,6),(1,7),(2,3),(2,4),(2,6),(2,7),(3,4),(3,5),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
 => ? ∊ {2,2,2,2,2,2,2,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),(0,6),(1,2),(1,5),(1,6),(1,7),(2,3),(2,4),(2,7),(3,4),(3,6),(3,7),(4,5),(4,7),(5,6),(5,7),(6,7)],8)
 => ([(0,3),(0,4),(0,5),(0,6),(0,8),(1,2),(1,5),(1,6),(1,7),(1,8),(2,3),(2,4),(2,7),(2,8),(3,4),(3,6),(3,7),(3,8),(4,5),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
 => ? ∊ {2,2,2,2,2,2,2,2} + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(0,5),(0,6),(1,3),(1,4),(2,3),(2,4),(2,5),(2,6),(3,4),(3,6),(4,5),(5,6)],7)
 => ([(0,1),(0,5),(0,6),(0,7),(1,3),(1,4),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,6),(3,7),(4,5),(4,7),(5,6),(5,7),(6,7)],8)
 => ? ∊ {2,2,2,2,2,2,2,2} + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(0,3),(0,6),(0,7),(1,2),(1,3),(1,4),(1,5),(2,5),(2,7),(3,4),(3,6),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
 => ([(0,2),(0,3),(0,6),(0,7),(0,8),(1,2),(1,3),(1,4),(1,5),(1,8),(2,5),(2,7),(2,8),(3,4),(3,6),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
 => ? ∊ {2,2,2,2,2,2,2,2} + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,4),(0,5),(0,7),(0,8),(1,2),(1,3),(1,7),(1,8),(2,3),(2,5),(2,6),(2,8),(3,4),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,8),(6,7),(6,8),(7,8)],9)
 => ([(0,1),(0,4),(0,5),(0,7),(0,8),(0,9),(1,2),(1,3),(1,7),(1,8),(1,9),(2,3),(2,5),(2,6),(2,8),(2,9),(3,4),(3,6),(3,7),(3,9),(4,5),(4,6),(4,7),(4,9),(5,6),(5,8),(5,9),(6,7),(6,8),(6,9),(7,8),(7,9),(8,9)],10)
 => ? ∊ {2,2,2,2,2,2,2,2} + 1
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(0,5),(0,6),(0,7),(0,8),(0,9),(1,2),(1,3),(1,6),(1,7),(1,8),(1,9),(2,3),(2,4),(2,5),(2,8),(2,9),(3,4),(3,5),(3,6),(3,7),(4,5),(4,7),(4,9),(5,6),(5,8),(6,7),(6,8),(7,9),(8,9)],10)
 => ([(0,4),(0,5),(0,6),(0,7),(0,8),(0,9),(0,10),(1,2),(1,3),(1,6),(1,7),(1,8),(1,9),(1,10),(2,3),(2,4),(2,5),(2,8),(2,9),(2,10),(3,4),(3,5),(3,6),(3,7),(3,10),(4,5),(4,7),(4,9),(4,10),(5,6),(5,8),(5,10),(6,7),(6,8),(6,10),(7,9),(7,10),(8,9),(8,10),(9,10)],11)
 => ? ∊ {2,2,2,2,2,2,2,2} + 1

Description

The number of vertices of the largest induced star graph in the graph.

The following 81 statistics, ordered by result quality, also match your data. Click on any of them to see the details.

St000381The largest part of an integer composition. St000382The first part of an integer composition. St000808The number of up steps of the associated bargraph. St000668The least common multiple of the parts of the partition. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000933The number of multipartitions of sizes given by an integer partition. St000917The open packing number of a graph. St001316The domatic number of a graph. St001330The hat guessing number of a graph. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001654The monophonic hull number of a graph. St001656The monophonic position number of a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St001389The number of partitions of the same length below the given integer partition. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St000455The second largest eigenvalue of a graph if it is integral. St000260The radius of a connected graph. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000907The number of maximal antichains of minimal length in a poset. St001520The number of strict 3-descents. St001118The acyclic chromatic index of a graph. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001060The distinguishing index of a graph. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000914The sum of the values of the Möbius function of a poset. St001545The second Elser number of a connected graph. St001568The smallest positive integer that does not appear twice in the partition. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000681The Grundy value of Chomp on Ferrers diagrams. St000706The product of the factorials of the multiplicities of an integer partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St000993The multiplicity of the largest part of an integer partition. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001570The minimal number of edges to add to make a graph Hamiltonian. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000454The largest eigenvalue of a graph if it is integral. St000422The energy of a graph, if it is integral. 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. St001877Number of indecomposable injective modules with projective dimension 2. St000046The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition. St000137The Grundy value of an integer partition. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000618The number of self-evacuating tableaux of given shape. St000667The greatest common divisor of the parts of the partition. St000781The number of proper colouring schemes of a Ferrers diagram. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. St001383The BG-rank of an integer partition. St001432The order dimension of the partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001571The Cartan determinant of the integer partition. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001780The order of promotion on the set of standard tableaux of given shape. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001924The number of cells in an integer partition whose arm and leg length coincide. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001199The dominant dimension of

$eAe$ for the corresponding Nakayama algebra

$A$ with minimal faithful projective-injective module

$eA$ . St001651The Frankl number of a lattice. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000456The monochromatic index of a connected graph. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. 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. St001645The pebbling number of a connected graph.