Your data matches 76 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
St001716: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> 1 = 0 + 1
([(1,2)],3)
=> 1 = 0 + 1
([(0,2),(1,2)],3)
=> 2 = 1 + 1
([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([(2,3)],4)
=> 1 = 0 + 1
([(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,3),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,3),(1,2)],4)
=> 1 = 0 + 1
([(0,3),(1,2),(2,3)],4)
=> 2 = 1 + 1
([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2 = 1 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(3,4)],5)
=> 1 = 0 + 1
([(2,4),(3,4)],5)
=> 2 = 1 + 1
([(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(1,4),(2,3)],5)
=> 1 = 0 + 1
([(1,4),(2,3),(3,4)],5)
=> 2 = 1 + 1
([(0,1),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> 2 = 1 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> 2 = 1 + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 2 = 1 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> 2 = 1 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 2 = 1 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(4,5)],6)
=> 1 = 0 + 1
([(3,5),(4,5)],6)
=> 2 = 1 + 1
([(2,5),(3,5),(4,5)],6)
=> 2 = 1 + 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> 2 = 1 + 1
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 2 = 1 + 1
([(2,5),(3,4)],6)
=> 1 = 0 + 1
([(2,5),(3,4),(4,5)],6)
=> 2 = 1 + 1
([(1,2),(3,5),(4,5)],6)
=> 2 = 1 + 1
([(3,4),(3,5),(4,5)],6)
=> 2 = 1 + 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> 2 = 1 + 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> 2 = 1 + 1
Description
The 1-improper chromatic number of a graph. This is the least number of colours in a vertex-colouring, such that each vertex has at most one neighbour with the same colour.
Mp00156: Graphs line graphGraphs
Mp00203: Graphs coneGraphs
St001335: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> ([],1)
=> ([(0,1)],2)
=> 0
([(1,2)],3)
=> ([],1)
=> ([(0,1)],2)
=> 0
([(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
([(2,3)],4)
=> ([],1)
=> ([(0,1)],2)
=> 0
([(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)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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)
=> 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)
=> 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)
=> 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)
=> 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)
=> 1
([(3,4)],5)
=> ([],1)
=> ([(0,1)],2)
=> 0
([(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)
=> 0
([(1,4),(2,3),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 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)
=> 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)
=> 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)
=> 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)
=> 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)
=> 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)
=> 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)
=> 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)
=> 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)
=> 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)
=> 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)
=> 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)
=> 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)
=> 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)
=> 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)
=> 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)
=> 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)
=> 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)
=> 1
([(4,5)],6)
=> ([],1)
=> ([(0,1)],2)
=> 0
([(3,5),(4,5)],6)
=> ([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> ([(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
([(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)
=> ([(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)
=> 1
([(2,5),(3,4)],6)
=> ([],2)
=> ([(0,2),(1,2)],3)
=> 0
([(2,5),(3,4),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,2),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
Description
The cardinality of a minimal cycle-isolating set of a graph. Let $\mathcal F$ be a set of graphs. A set of vertices $S$ is $\mathcal F$-isolating, if the subgraph induced by the vertices in the complement of the closed neighbourhood of $S$ does not contain any graph in $\mathcal F$. This statistic returns the cardinality of the smallest isolating set when $\mathcal F$ contains all cycles.
Mp00156: Graphs line graphGraphs
Mp00154: Graphs coreGraphs
St001349: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> ([],1)
=> ([],1)
=> 0
([(1,2)],3)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(1,3),(2,3)],4)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> ([],1)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 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,1),(0,2),(1,2)],3)
=> 1
([(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(2,4),(3,4)],5)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,4),(2,3)],5)
=> ([],2)
=> ([],1)
=> 0
([(1,4),(2,3),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 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,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],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,2),(1,2)],3)
=> 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,1),(0,2),(1,2)],3)
=> 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,1),(0,2),(1,2)],3)
=> 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,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,1)],2)
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 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,1),(0,2),(1,2)],3)
=> 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,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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),(1,2),(1,4),(2,3)],5)
=> 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,1),(0,2),(1,2)],3)
=> 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,1),(0,2),(1,2)],3)
=> 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,1),(0,2),(1,2)],3)
=> 1
([(4,5)],6)
=> ([],1)
=> ([],1)
=> 0
([(3,5),(4,5)],6)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(2,5),(3,4)],6)
=> ([],2)
=> ([],1)
=> 0
([(2,5),(3,4),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(1,2),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 1
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
Description
The number of different graphs obtained from the given graph by removing an edge.
Mp00156: Graphs line graphGraphs
Mp00154: Graphs coreGraphs
St001393: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> ([],1)
=> ([],1)
=> 0
([(1,2)],3)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(1,3),(2,3)],4)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> ([],1)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 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,1),(0,2),(1,2)],3)
=> 1
([(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(2,4),(3,4)],5)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,4),(2,3)],5)
=> ([],2)
=> ([],1)
=> 0
([(1,4),(2,3),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 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,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],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,2),(1,2)],3)
=> 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,1),(0,2),(1,2)],3)
=> 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,1),(0,2),(1,2)],3)
=> 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,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,1)],2)
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 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,1),(0,2),(1,2)],3)
=> 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,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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),(1,2),(1,4),(2,3)],5)
=> 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,1),(0,2),(1,2)],3)
=> 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,1),(0,2),(1,2)],3)
=> 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,1),(0,2),(1,2)],3)
=> 1
([(4,5)],6)
=> ([],1)
=> ([],1)
=> 0
([(3,5),(4,5)],6)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(2,5),(3,4)],6)
=> ([],2)
=> ([],1)
=> 0
([(2,5),(3,4),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(1,2),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 1
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
Description
The induced matching number of a graph. An induced matching of a graph is a set of independent edges which is an induced subgraph. This statistic records the maximal number of edges in an induced matching.
Matching statistic: St000481
Mp00037: Graphs to partition of connected componentsInteger partitions
Mp00044: Integer partitions conjugateInteger partitions
Mp00202: Integer partitions first row removalInteger partitions
St000481: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> [2]
=> [1,1]
=> [1]
=> 0
([(1,2)],3)
=> [2,1]
=> [2,1]
=> [1]
=> 0
([(0,2),(1,2)],3)
=> [3]
=> [1,1,1]
=> [1,1]
=> 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,1,1]
=> [1,1]
=> 1
([(2,3)],4)
=> [2,1,1]
=> [3,1]
=> [1]
=> 0
([(1,3),(2,3)],4)
=> [3,1]
=> [2,1,1]
=> [1,1]
=> 1
([(0,3),(1,3),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> [1,1,1]
=> 1
([(0,3),(1,2)],4)
=> [2,2]
=> [2,2]
=> [2]
=> 0
([(0,3),(1,2),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> [1,1,1]
=> 1
([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [2,1,1]
=> [1,1]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> [1,1,1]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1]
=> [1,1,1]
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> [1,1,1]
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> [1,1,1]
=> 1
([(3,4)],5)
=> [2,1,1,1]
=> [4,1]
=> [1]
=> 0
([(2,4),(3,4)],5)
=> [3,1,1]
=> [3,1,1]
=> [1,1]
=> 1
([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> [1,1,1]
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,1,1]
=> 1
([(1,4),(2,3)],5)
=> [2,2,1]
=> [3,2]
=> [2]
=> 0
([(1,4),(2,3),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> [1,1,1]
=> 1
([(0,1),(2,4),(3,4)],5)
=> [3,2]
=> [2,2,1]
=> [2,1]
=> 1
([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [3,1,1]
=> [1,1]
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,1,1]
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> [1,1,1]
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,1,1]
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4,1]
=> [2,1,1,1]
=> [1,1,1]
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,1,1]
=> 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> [1,1,1]
=> 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,1,1]
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,1,1]
=> 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,1,1]
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,1,1]
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,2]
=> [2,2,1]
=> [2,1]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,1,1]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,1,1]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,1,1]
=> 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,1,1]
=> 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,1,1]
=> 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> [1,1,1]
=> 1
([(4,5)],6)
=> [2,1,1,1,1]
=> [5,1]
=> [1]
=> 0
([(3,5),(4,5)],6)
=> [3,1,1,1]
=> [4,1,1]
=> [1,1]
=> 1
([(2,5),(3,5),(4,5)],6)
=> [4,1,1]
=> [3,1,1,1]
=> [1,1,1]
=> 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> [5,1]
=> [2,1,1,1,1]
=> [1,1,1,1]
=> 1
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [6]
=> [1,1,1,1,1,1]
=> [1,1,1,1,1]
=> 1
([(2,5),(3,4)],6)
=> [2,2,1,1]
=> [4,2]
=> [2]
=> 0
([(2,5),(3,4),(4,5)],6)
=> [4,1,1]
=> [3,1,1,1]
=> [1,1,1]
=> 1
([(1,2),(3,5),(4,5)],6)
=> [3,2,1]
=> [3,2,1]
=> [2,1]
=> 1
([(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [4,1,1]
=> [1,1]
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [5,1]
=> [2,1,1,1,1]
=> [1,1,1,1]
=> 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> [4,2]
=> [2,2,1,1]
=> [2,1,1]
=> 1
Description
The number of upper covers of a partition in dominance order.
Matching statistic: St000660
Mp00037: Graphs to partition of connected componentsInteger partitions
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00227: Dyck paths Delest-Viennot-inverseDyck paths
St000660: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> [2]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(1,2)],3)
=> [2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0
([(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(2,3)],4)
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 0
([(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,3),(1,3),(2,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(0,3),(1,2)],4)
=> [2,2]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 0
([(0,3),(1,2),(2,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(3,4)],5)
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 0
([(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(1,4),(2,3)],5)
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 0
([(1,4),(2,3),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
([(0,1),(2,4),(3,4)],5)
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 1
([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
([(4,5)],6)
=> [2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> 0
([(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> 1
([(2,5),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 1
([(2,5),(3,4)],6)
=> [2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 0
([(2,5),(3,4),(4,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> 1
([(1,2),(3,5),(4,5)],6)
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 1
([(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1
Description
The number of rises of length at least 3 of a Dyck path. The number of Dyck paths without such rises are counted by the Motzkin numbers [1].
Matching statistic: St000741
Mp00156: Graphs line graphGraphs
Mp00154: Graphs coreGraphs
Mp00111: Graphs complementGraphs
St000741: Graphs ⟶ ℤResult quality: 98% values known / values provided: 98%distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0
([(1,2)],3)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> ([],2)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 1
([(2,3)],4)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0
([(1,3),(2,3)],4)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> ([],2)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> ([],1)
=> ([],1)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> ([],2)
=> 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> ([],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,1),(0,2),(1,2)],3)
=> ([],3)
=> 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,1),(0,2),(1,2)],3)
=> ([],3)
=> 1
([(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0
([(2,4),(3,4)],5)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> ([],2)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(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)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 1
([(1,4),(2,3)],5)
=> ([],2)
=> ([],1)
=> ([],1)
=> 0
([(1,4),(2,3),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> ([],2)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> ([],2)
=> 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(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)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 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,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> ([],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,2),(1,2)],3)
=> ([],3)
=> 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,1),(0,2),(1,2)],3)
=> ([],3)
=> 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,1),(0,2),(1,2)],3)
=> ([],3)
=> 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,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 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,1),(0,2),(1,2)],3)
=> ([],3)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,1)],2)
=> ([],2)
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 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,1),(0,2),(1,2)],3)
=> ([],3)
=> 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,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 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),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ? = 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,1),(0,2),(1,2)],3)
=> ([],3)
=> 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,1),(0,2),(1,2)],3)
=> ([],3)
=> 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,1),(0,2),(1,2)],3)
=> ([],3)
=> 1
([(4,5)],6)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0
([(3,5),(4,5)],6)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> ([],2)
=> 1
([(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],5)
=> 1
([(2,5),(3,4)],6)
=> ([],2)
=> ([],1)
=> ([],1)
=> 0
([(2,5),(3,4),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> ([],2)
=> 1
([(1,2),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> ([],2)
=> 1
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 1
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(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)
=> ? = 1
([(2,5),(2,6),(3,4),(3,6),(4,5)],7)
=> ([(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)
=> ? = 1
([(0,1),(2,5),(2,6),(3,4),(3,6),(4,5)],7)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ? = 1
Description
The Colin de Verdière graph invariant.
Mp00275: Graphs to edge-partition of connected componentsInteger partitions
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00222: Dyck paths peaks-to-valleysDyck paths
St000659: Dyck paths ⟶ ℤResult quality: 97% values known / values provided: 97%distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> [1]
=> [1,0]
=> [1,0]
=> ? = 0
([(1,2)],3)
=> [1]
=> [1,0]
=> [1,0]
=> ? = 0
([(0,2),(1,2)],3)
=> [2]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(2,3)],4)
=> [1]
=> [1,0]
=> [1,0]
=> ? = 0
([(1,3),(2,3)],4)
=> [2]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
([(0,3),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(0,3),(1,2)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(0,3),(1,2),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 1
([(3,4)],5)
=> [1]
=> [1,0]
=> [1,0]
=> ? = 0
([(2,4),(3,4)],5)
=> [2]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
([(1,4),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(1,4),(2,3)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(1,4),(2,3),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(0,1),(2,4),(3,4)],5)
=> [2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 1
([(4,5)],6)
=> [1]
=> [1,0]
=> [1,0]
=> ? = 0
([(3,5),(4,5)],6)
=> [2]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
([(2,5),(3,5),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(2,5),(3,4)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(2,5),(3,4),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(1,2),(3,5),(4,5)],6)
=> [2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 1
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(5,6)],7)
=> [1]
=> [1,0]
=> [1,0]
=> ? = 0
Description
The number of rises of length at least 2 of a Dyck path.
Mp00147: Graphs squareGraphs
St000264: Graphs ⟶ ℤResult quality: 50% values known / values provided: 93%distinct values known / distinct values provided: 50%
Values
([(0,1)],2)
=> ([(0,1)],2)
=> ? = 0 + 2
([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0 + 2
([(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3 = 1 + 2
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3 = 1 + 2
([(2,3)],4)
=> ([(2,3)],4)
=> ? = 0 + 2
([(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 3 = 1 + 2
([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 1 + 2
([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> ? = 0 + 2
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 1 + 2
([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 3 = 1 + 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 1 + 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 1 + 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 1 + 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 1 + 2
([(3,4)],5)
=> ([(3,4)],5)
=> ? = 0 + 2
([(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
([(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ? = 0 + 2
([(1,4),(2,3),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
([(4,5)],6)
=> ([(4,5)],6)
=> ? = 0 + 2
([(3,5),(4,5)],6)
=> ([(3,4),(3,5),(4,5)],6)
=> 3 = 1 + 2
([(2,5),(3,5),(4,5)],6)
=> ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 1 + 2
([(1,5),(2,5),(3,5),(4,5)],6)
=> ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 1 + 2
([(0,5),(1,5),(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)
=> 3 = 1 + 2
([(2,5),(3,4)],6)
=> ([(2,5),(3,4)],6)
=> ? = 0 + 2
([(2,5),(3,4),(4,5)],6)
=> ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 1 + 2
([(1,2),(3,5),(4,5)],6)
=> ([(1,2),(3,4),(3,5),(4,5)],6)
=> 3 = 1 + 2
([(3,4),(3,5),(4,5)],6)
=> ([(3,4),(3,5),(4,5)],6)
=> 3 = 1 + 2
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 1 + 2
([(0,1),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 1 + 2
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 1 + 2
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([(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 = 1 + 2
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 1 + 2
([(0,5),(1,5),(2,5),(3,4),(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)
=> 3 = 1 + 2
([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 1 + 2
([(0,5),(1,5),(2,4),(3,4)],6)
=> ([(0,4),(0,5),(1,2),(1,3),(2,3),(4,5)],6)
=> 3 = 1 + 2
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 1 + 2
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,3),(0,5),(1,2),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 1 + 2
([(0,5),(1,4),(2,3)],6)
=> ([(0,5),(1,4),(2,3)],6)
=> ? = 0 + 2
([(5,6)],7)
=> ([(5,6)],7)
=> ? = 0 + 2
([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ? = 0 + 2
([(1,6),(2,5),(3,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ? = 0 + 2
Description
The girth of a graph, which is not a tree. This is the length of the shortest cycle in the graph.
Mp00156: Graphs line graphGraphs
Mp00154: Graphs coreGraphs
St001704: Graphs ⟶ ℤResult quality: 50% values known / values provided: 93%distinct values known / distinct values provided: 50%
Values
([(0,1)],2)
=> ([],1)
=> ([],1)
=> ? = 0 + 1
([(1,2)],3)
=> ([],1)
=> ([],1)
=> ? = 0 + 1
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 2 = 1 + 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([(2,3)],4)
=> ([],1)
=> ([],1)
=> ? = 0 + 1
([(1,3),(2,3)],4)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 2 = 1 + 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([(0,3),(1,2)],4)
=> ([],2)
=> ([],1)
=> ? = 0 + 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2 = 1 + 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 2 = 1 + 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,1),(0,2),(1,2)],3)
=> 2 = 1 + 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,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([(3,4)],5)
=> ([],1)
=> ([],1)
=> ? = 0 + 1
([(2,4),(3,4)],5)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 2 = 1 + 1
([(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 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),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(1,4),(2,3)],5)
=> ([],2)
=> ([],1)
=> ? = 0 + 1
([(1,4),(2,3),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2 = 1 + 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 2 = 1 + 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 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,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 2 = 1 + 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,2),(1,2)],3)
=> 2 = 1 + 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,1),(0,2),(1,2)],3)
=> 2 = 1 + 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,1),(0,2),(1,2)],3)
=> 2 = 1 + 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,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 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,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,1)],2)
=> 2 = 1 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 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,1),(0,2),(1,2)],3)
=> 2 = 1 + 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,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 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),(1,2),(1,4),(2,3)],5)
=> 2 = 1 + 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,1),(0,2),(1,2)],3)
=> 2 = 1 + 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,1),(0,2),(1,2)],3)
=> 2 = 1 + 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,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([(4,5)],6)
=> ([],1)
=> ([],1)
=> ? = 0 + 1
([(3,5),(4,5)],6)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 2 = 1 + 1
([(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(2,5),(3,4)],6)
=> ([],2)
=> ([],1)
=> ? = 0 + 1
([(2,5),(3,4),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2 = 1 + 1
([(1,2),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 2 = 1 + 1
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(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),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 2 = 1 + 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> ([(0,3),(1,2)],4)
=> ([(0,1)],2)
=> 2 = 1 + 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([(0,5),(1,4),(2,3)],6)
=> ([],3)
=> ([],1)
=> ? = 0 + 1
([(5,6)],7)
=> ([],1)
=> ([],1)
=> ? = 0 + 1
([(3,6),(4,5)],7)
=> ([],2)
=> ([],1)
=> ? = 0 + 1
([(1,6),(2,5),(3,4)],7)
=> ([],3)
=> ([],1)
=> ? = 0 + 1
Description
The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. The deck of a graph is the multiset of induced subgraphs obtained by deleting a single vertex. The graph reconstruction conjecture states that the deck of a graph with at least three vertices determines the graph. This statistic is only defined for graphs with at least two vertices, because there is only a single graph of the given size otherwise.
The following 66 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000781The number of proper colouring schemes of a Ferrers diagram. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000455The second largest eigenvalue of a graph if it is integral. St001570The minimal number of edges to add to make a graph Hamiltonian. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St001128The exponens consonantiae of a partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000225Difference between largest and smallest parts in a partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001586The number of odd parts smaller than the largest even part in an integer partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001592The maximal number of simple paths between any two different vertices of a graph. St000379The number of Hamiltonian cycles in a graph. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001060The distinguishing index of a graph. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St000456The monochromatic index of a connected graph. St001118The acyclic chromatic index of a graph. St001281The normalized isoperimetric number of a graph. St000464The Schultz index of a connected graph. St001545The second Elser number of a connected graph. St000699The toughness times the least common multiple of 1,. St000284The Plancherel distribution on integer partitions. St000706The product of the factorials of the multiplicities of an integer partition. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000928The sum of the coefficients of the character polynomial of an integer partition. St000993The multiplicity of the largest part of an integer partition. St001568The smallest positive integer that does not appear twice in the partition. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St000567The sum of the products of all pairs of parts. St000929The constant term of the character polynomial of an integer partition. St000936The number of even values of the symmetric group character corresponding to the partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001098The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for vertex labelled trees. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. 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. 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. St000478Another weight of a partition according to Alladi. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000713The dimension of the irreducible representation of Sp(4) labelled by an integer partition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000934The 2-degree of an integer partition. 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. St001875The number of simple modules with projective dimension at most 1. St001877Number of indecomposable injective modules with projective dimension 2. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001871The number of triconnected components of a graph. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles.