Your data matches 711 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Mp00198: Posets incomparability graphGraphs
Mp00037: Graphs to partition of connected componentsInteger partitions
Mp00202: Integer partitions first row removalInteger partitions
St000205: 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
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> [2,1]
=> [1]
=> 0
([(0,2),(2,1)],3)
=> ([],3)
=> [1,1,1]
=> [1,1]
=> 0
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> [2,1]
=> [1]
=> 0
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1]
=> 0
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> [3,1]
=> [1]
=> 0
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> [2,1,1]
=> [1,1]
=> 0
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> [2,1,1]
=> [1,1]
=> 0
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> [2,1,1]
=> [1,1]
=> 0
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1]
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> [2,2]
=> [2]
=> 0
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> [1,1,1,1]
=> [1,1,1]
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> [3,1]
=> [1]
=> 0
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,1]
=> 0
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> [2,1,1,1]
=> [1,1,1]
=> 0
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> [2,2,1]
=> [2,1]
=> 0
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,1]
=> 0
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> [2,2,1]
=> [2,1]
=> 0
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,1]
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,2]
=> [2]
=> 0
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> [2,1,1,1]
=> [1,1,1]
=> 0
([(0,4),(1,3),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,3),(0,4),(1,3),(1,4),(4,2)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> [3,2]
=> [2]
=> 0
([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> ([(1,4),(2,3)],5)
=> [2,2,1]
=> [2,1]
=> 0
([(0,2),(0,4),(3,1),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(2,4),(3,4)],5)
=> [3,1,1]
=> [1,1]
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,2]
=> [2]
=> 0
([(0,3),(0,4),(1,2),(2,3),(2,4)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> [3,2]
=> [2]
=> 0
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(3,4)],5)
=> [2,1,1,1]
=> [1,1,1]
=> 0
([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> [3,1,1]
=> [1,1]
=> 0
([(0,4),(3,2),(4,1),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> [3,1,1]
=> [1,1]
=> 0
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> [1,1,1,1,1]
=> [1,1,1,1]
=> 0
([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> [2,1,1,1]
=> [1,1,1]
=> 0
([(0,1),(0,2),(0,3),(0,4),(0,5)],6)
=> ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [5,1]
=> [1]
=> 0
([(0,2),(0,3),(0,4),(0,5),(5,1)],6)
=> ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [5,1]
=> [1]
=> 0
([(0,1),(0,2),(0,3),(0,4),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [5,1]
=> [1]
=> 0
([(0,1),(0,2),(0,3),(0,4),(2,5),(3,5),(4,5)],6)
=> ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [5,1]
=> [1]
=> 0
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1]
=> 0
Description
Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. Given $\lambda$ count how many ''integer partitions'' $w$ (weight) there are, such that $P_{\lambda,w}$ is non-integral, i.e., $w$ such that the Gelfand-Tsetlin polytope $P_{\lambda,w}$ has at least one non-integral vertex.
Mp00198: Posets incomparability graphGraphs
Mp00037: Graphs to partition of connected componentsInteger partitions
Mp00202: Integer partitions first row removalInteger partitions
St000206: 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
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> [2,1]
=> [1]
=> 0
([(0,2),(2,1)],3)
=> ([],3)
=> [1,1,1]
=> [1,1]
=> 0
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> [2,1]
=> [1]
=> 0
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1]
=> 0
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> [3,1]
=> [1]
=> 0
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> [2,1,1]
=> [1,1]
=> 0
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> [2,1,1]
=> [1,1]
=> 0
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> [2,1,1]
=> [1,1]
=> 0
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1]
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> [2,2]
=> [2]
=> 0
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> [1,1,1,1]
=> [1,1,1]
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> [3,1]
=> [1]
=> 0
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,1]
=> 0
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> [2,1,1,1]
=> [1,1,1]
=> 0
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> [2,2,1]
=> [2,1]
=> 0
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,1]
=> 0
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> [2,2,1]
=> [2,1]
=> 0
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,1]
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,2]
=> [2]
=> 0
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> [2,1,1,1]
=> [1,1,1]
=> 0
([(0,4),(1,3),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,3),(0,4),(1,3),(1,4),(4,2)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> [3,2]
=> [2]
=> 0
([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> ([(1,4),(2,3)],5)
=> [2,2,1]
=> [2,1]
=> 0
([(0,2),(0,4),(3,1),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(2,4),(3,4)],5)
=> [3,1,1]
=> [1,1]
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,2]
=> [2]
=> 0
([(0,3),(0,4),(1,2),(2,3),(2,4)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> [3,2]
=> [2]
=> 0
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(3,4)],5)
=> [2,1,1,1]
=> [1,1,1]
=> 0
([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> [3,1,1]
=> [1,1]
=> 0
([(0,4),(3,2),(4,1),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> [3,1,1]
=> [1,1]
=> 0
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> [1,1,1,1,1]
=> [1,1,1,1]
=> 0
([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> [2,1,1,1]
=> [1,1,1]
=> 0
([(0,1),(0,2),(0,3),(0,4),(0,5)],6)
=> ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [5,1]
=> [1]
=> 0
([(0,2),(0,3),(0,4),(0,5),(5,1)],6)
=> ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [5,1]
=> [1]
=> 0
([(0,1),(0,2),(0,3),(0,4),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [5,1]
=> [1]
=> 0
([(0,1),(0,2),(0,3),(0,4),(2,5),(3,5),(4,5)],6)
=> ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [5,1]
=> [1]
=> 0
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1]
=> 0
Description
Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. Given $\lambda$ count how many ''integer compositions'' $w$ (weight) there are, such that $P_{\lambda,w}$ is non-integral, i.e., $w$ such that the Gelfand-Tsetlin polytope $P_{\lambda,w}$ has at least one non-integral vertex. See also [[St000205]]. Each value in this statistic is greater than or equal to corresponding value in [[St000205]].
Mp00198: Posets incomparability graphGraphs
Mp00247: Graphs de-duplicateGraphs
Mp00111: Graphs complementGraphs
St001325: Graphs ⟶ ℤResult quality: 50% values known / values provided: 93%distinct values known / distinct values provided: 50%
Values
([(0,1)],2)
=> ([],2)
=> ([],1)
=> ([],1)
=> 0
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,2),(2,1)],3)
=> ([],3)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 0
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> ([],1)
=> ([],1)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(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)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 0
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 0
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(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)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 0
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,4),(1,3),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,3),(0,4),(1,3),(1,4),(4,2)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 0
([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 0
([(0,2),(0,4),(3,1),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 0
([(0,3),(0,4),(1,2),(2,3),(2,4)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 0
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,4),(3,2),(4,1),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> ([],1)
=> ([],1)
=> 0
([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,1),(0,2),(0,3),(0,4),(0,5)],6)
=> ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(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)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 0
([(0,2),(0,3),(0,4),(0,5),(5,1)],6)
=> ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(0,1),(0,2),(0,3),(0,4),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
([(0,1),(0,2),(0,3),(0,4),(2,5),(3,5),(4,5)],6)
=> ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(0,2),(0,3),(2,4),(2,6),(3,4),(3,6),(4,5),(6,1),(6,5)],7)
=> ([(1,2),(3,6),(4,5),(5,6)],7)
=> ([(1,2),(3,6),(4,5),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
=> ? = 0
([(0,1),(0,2),(1,5),(1,6),(2,5),(2,6),(5,3),(5,4),(6,3),(6,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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
([(0,6),(1,6),(3,5),(4,2),(4,5),(6,3),(6,4)],7)
=> ([(1,2),(3,6),(4,5),(5,6)],7)
=> ([(1,2),(3,6),(4,5),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
=> ? = 0
([(0,6),(1,6),(2,4),(2,5),(3,4),(3,5),(6,2),(6,3)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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
([(0,5),(0,6),(1,5),(1,6),(2,3),(4,3),(5,4),(6,2),(6,4)],7)
=> ([(1,2),(3,6),(4,5),(5,6)],7)
=> ([(1,2),(3,6),(4,5),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
=> ? = 0
([(0,5),(0,6),(1,5),(1,6),(3,2),(4,2),(5,3),(5,4),(6,3),(6,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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
([(0,5),(1,4),(1,5),(4,6),(5,6),(6,2),(6,3)],7)
=> ([(1,2),(3,6),(4,5),(5,6)],7)
=> ([(1,2),(3,6),(4,5),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
=> ? = 0
([(0,5),(0,6),(1,5),(1,6),(2,4),(5,2),(5,3),(6,3),(6,4)],7)
=> ([(0,1),(2,5),(3,4),(4,6),(5,6)],7)
=> ([(0,1),(2,5),(3,4),(4,6),(5,6)],7)
=> ([(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,5),(3,6),(4,5),(4,6)],7)
=> ? = 0
([(0,5),(0,6),(1,5),(1,6),(4,2),(4,3),(5,4),(6,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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
([(0,2),(0,3),(1,5),(1,6),(2,4),(3,1),(3,4),(4,5),(4,6)],7)
=> ([(1,2),(3,6),(4,5),(5,6)],7)
=> ([(1,2),(3,6),(4,5),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
=> ? = 0
([(0,3),(0,4),(2,5),(3,6),(4,2),(4,6),(6,1),(6,5)],7)
=> ([(1,6),(2,5),(3,4),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(3,4),(4,6),(5,6)],7)
=> ([(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)
=> ? = 0
([(0,2),(0,3),(1,4),(1,6),(2,4),(2,5),(3,1),(3,5),(5,6)],7)
=> ([(1,6),(2,5),(3,4),(3,5),(4,6)],7)
=> ([(1,6),(2,5),(3,4),(3,5),(4,6)],7)
=> ([(0,1),(0,3),(0,5),(0,6),(1,2),(1,4),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
([(0,2),(0,6),(1,5),(1,6),(2,5),(5,3),(5,4),(6,3),(6,4)],7)
=> ([(0,1),(2,5),(3,4),(4,6),(5,6)],7)
=> ([(0,1),(2,5),(3,4),(4,6),(5,6)],7)
=> ([(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,5),(3,6),(4,5),(4,6)],7)
=> ? = 0
([(0,6),(1,2),(1,6),(2,4),(2,5),(4,3),(5,3),(6,4),(6,5)],7)
=> ([(1,2),(3,6),(4,5),(5,6)],7)
=> ([(1,2),(3,6),(4,5),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
=> ? = 0
([(0,6),(1,3),(1,6),(2,4),(3,5),(5,4),(6,2),(6,5)],7)
=> ([(1,6),(2,5),(3,4),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(3,4),(4,6),(5,6)],7)
=> ([(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)
=> ? = 0
([(0,2),(0,6),(1,5),(1,6),(2,4),(2,5),(4,3),(5,3),(6,4)],7)
=> ([(1,6),(2,5),(3,4),(3,5),(4,6)],7)
=> ([(1,6),(2,5),(3,4),(3,5),(4,6)],7)
=> ([(0,1),(0,3),(0,5),(0,6),(1,2),(1,4),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
([(0,7),(2,4),(3,2),(4,6),(5,3),(6,1),(7,5)],8)
=> ([],8)
=> ?
=> ?
=> ? = 0
([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
=> ([(2,7),(3,5),(3,8),(4,6),(4,8),(5,6),(5,7),(6,8),(7,8)],9)
=> ([(1,6),(2,4),(2,7),(3,5),(3,7),(4,5),(4,6),(5,7),(6,7)],8)
=> ?
=> ? = 0
([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
=> ([(1,2),(1,7),(1,9),(2,6),(2,8),(3,4),(3,6),(3,8),(3,9),(4,7),(4,8),(4,9),(5,6),(5,7),(5,8),(5,9),(6,7),(6,9),(7,8),(8,9)],10)
=> ([(1,2),(1,7),(1,9),(2,6),(2,8),(3,4),(3,6),(3,8),(3,9),(4,7),(4,8),(4,9),(5,6),(5,7),(5,8),(5,9),(6,7),(6,9),(7,8),(8,9)],10)
=> ([(0,3),(0,8),(0,9),(1,2),(1,7),(1,9),(2,5),(2,7),(2,9),(3,6),(3,8),(3,9),(4,5),(4,6),(4,7),(4,8),(4,9),(5,7),(5,8),(5,9),(6,7),(6,8),(6,9),(7,9),(8,9)],10)
=> ? = 0
([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
=> ([(2,10),(3,6),(3,10),(3,13),(4,9),(4,11),(4,14),(4,15),(5,12),(5,13),(5,14),(5,15),(6,12),(6,14),(6,15),(7,8),(7,9),(7,12),(7,14),(7,15),(8,11),(8,13),(8,14),(8,15),(9,11),(9,13),(9,15),(10,12),(10,14),(10,15),(11,12),(11,14),(11,15),(12,13),(13,14),(13,15)],16)
=> ([(1,9),(2,5),(2,9),(2,12),(3,8),(3,10),(3,13),(3,14),(4,11),(4,12),(4,13),(4,14),(5,11),(5,13),(5,14),(6,7),(6,8),(6,11),(6,13),(6,14),(7,10),(7,12),(7,13),(7,14),(8,10),(8,12),(8,14),(9,11),(9,13),(9,14),(10,11),(10,13),(10,14),(11,12),(12,13),(12,14)],15)
=> ?
=> ? = 0
([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
=> ([(2,9),(2,10),(2,11),(3,4),(3,5),(3,8),(3,11),(4,5),(4,7),(4,10),(5,6),(5,9),(6,7),(6,8),(6,10),(6,11),(7,8),(7,9),(7,11),(8,9),(8,10),(9,10),(9,11),(10,11)],12)
=> ([(1,8),(1,9),(1,10),(2,3),(2,4),(2,7),(2,10),(3,4),(3,6),(3,9),(4,5),(4,8),(5,6),(5,7),(5,9),(5,10),(6,7),(6,8),(6,10),(7,8),(7,9),(8,9),(8,10),(9,10)],11)
=> ?
=> ? = 0
([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
=> ([(1,2),(1,10),(1,12),(1,14),(2,9),(2,11),(2,13),(3,7),(3,8),(3,11),(3,12),(3,13),(3,14),(4,9),(4,10),(4,11),(4,12),(4,13),(4,14),(5,6),(5,8),(5,9),(5,11),(5,12),(5,13),(5,14),(6,7),(6,10),(6,11),(6,12),(6,13),(6,14),(7,8),(7,9),(7,11),(7,13),(7,14),(8,10),(8,12),(8,13),(8,14),(9,10),(9,12),(9,14),(10,11),(10,13),(11,12),(11,14),(12,13),(13,14)],15)
=> ([(1,2),(1,10),(1,12),(1,14),(2,9),(2,11),(2,13),(3,7),(3,8),(3,11),(3,12),(3,13),(3,14),(4,9),(4,10),(4,11),(4,12),(4,13),(4,14),(5,6),(5,8),(5,9),(5,11),(5,12),(5,13),(5,14),(6,7),(6,10),(6,11),(6,12),(6,13),(6,14),(7,8),(7,9),(7,11),(7,13),(7,14),(8,10),(8,12),(8,13),(8,14),(9,10),(9,12),(9,14),(10,11),(10,13),(11,12),(11,14),(12,13),(13,14)],15)
=> ([(0,3),(0,9),(0,13),(0,14),(1,2),(1,8),(1,12),(1,14),(2,6),(2,8),(2,12),(2,14),(3,7),(3,9),(3,13),(3,14),(4,6),(4,8),(4,10),(4,11),(4,12),(4,13),(4,14),(5,7),(5,9),(5,10),(5,11),(5,12),(5,13),(5,14),(6,8),(6,10),(6,12),(6,13),(6,14),(7,9),(7,10),(7,12),(7,13),(7,14),(8,11),(8,12),(8,14),(9,11),(9,13),(9,14),(10,11),(10,12),(10,13),(10,14),(11,12),(11,13),(11,14),(12,14),(13,14)],15)
=> ? = 0
([(0,4),(1,6),(2,5),(3,5),(3,6),(4,1),(4,2),(4,3),(5,7),(6,7)],8)
=> ([(3,6),(3,7),(4,5),(4,7),(5,6),(6,7)],8)
=> ?
=> ?
=> ? = 0
([(0,5),(1,7),(2,7),(3,6),(4,6),(5,1),(5,2),(7,3),(7,4)],8)
=> ([(4,7),(5,6)],8)
=> ?
=> ?
=> ? = 0
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,6),(4,7),(5,7),(7,6)],8)
=> ([(2,7),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ?
=> ? = 0
([(0,3),(0,4),(1,6),(2,6),(3,7),(4,7),(5,1),(5,2),(7,5)],8)
=> ([(4,7),(5,6)],8)
=> ?
=> ?
=> ? = 0
([(0,4),(0,5),(1,6),(2,6),(4,7),(5,7),(6,3),(7,1),(7,2)],8)
=> ([(4,7),(5,6)],8)
=> ?
=> ?
=> ? = 0
([(0,3),(0,5),(1,7),(3,6),(4,2),(5,1),(5,6),(6,7),(7,4)],8)
=> ([(4,7),(5,6),(6,7)],8)
=> ?
=> ?
=> ? = 0
([(0,5),(2,7),(3,6),(4,2),(4,6),(5,3),(5,4),(6,7),(7,1)],8)
=> ([(4,7),(5,6),(6,7)],8)
=> ?
=> ?
=> ? = 0
([(0,5),(0,6),(1,7),(2,7),(3,2),(4,1),(5,3),(6,4)],8)
=> ([(2,5),(2,6),(2,7),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7)],8)
=> ?
=> ?
=> ? = 0
([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
=> ([(4,7),(5,6),(6,7)],8)
=> ?
=> ?
=> ? = 0
([(0,5),(1,6),(2,7),(3,4),(3,6),(4,2),(4,8),(5,1),(5,3),(6,8),(8,7)],9)
=> ([(3,8),(4,7),(5,6),(5,7),(6,8),(7,8)],9)
=> ?
=> ?
=> ? = 0
([(0,5),(1,7),(2,8),(3,6),(4,3),(4,8),(5,2),(5,4),(6,7),(8,1),(8,6)],9)
=> ([(3,8),(4,7),(5,6),(6,8),(7,8)],9)
=> ?
=> ?
=> ? = 0
([(0,3),(0,5),(2,8),(3,6),(4,2),(4,7),(5,4),(5,6),(6,7),(7,8),(8,1)],9)
=> ([(3,8),(4,7),(5,6),(5,7),(6,8),(7,8)],9)
=> ?
=> ?
=> ? = 0
([(0,4),(0,5),(1,6),(3,7),(4,8),(5,1),(5,8),(6,7),(7,2),(8,3),(8,6)],9)
=> ([(3,8),(4,7),(5,6),(6,8),(7,8)],9)
=> ?
=> ?
=> ? = 0
([(0,1),(0,2),(0,3),(0,4),(1,6),(1,7),(2,6),(2,7),(3,6),(3,7),(4,6),(4,7),(6,5),(7,5)],8)
=> ([(2,3),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ?
=> ? = 0
([(0,6),(1,7),(2,9),(4,8),(5,1),(5,9),(6,2),(6,5),(7,8),(8,3),(9,4),(9,7)],10)
=> ([(4,9),(5,8),(6,7),(7,9),(8,9)],10)
=> ?
=> ?
=> ? = 0
([(0,6),(1,11),(2,8),(3,9),(4,5),(4,11),(5,3),(5,7),(6,1),(6,4),(7,8),(7,9),(8,10),(9,10),(11,2),(11,7)],12)
=> ([(3,9),(4,5),(4,11),(5,10),(6,10),(6,11),(7,8),(7,11),(8,9),(8,10),(9,11),(10,11)],12)
=> ?
=> ?
=> ? = 0
([(0,7),(1,13),(2,12),(3,9),(4,11),(5,6),(5,12),(6,4),(6,8),(7,2),(7,5),(8,11),(8,13),(10,9),(11,10),(12,1),(12,8),(13,3),(13,10)],14)
=> ([(3,11),(4,10),(5,8),(5,13),(6,9),(6,13),(7,12),(7,13),(8,10),(8,12),(9,11),(9,12),(10,13),(11,13),(12,13)],14)
=> ?
=> ?
=> ? = 0
([(0,8),(1,14),(3,13),(4,12),(5,11),(6,7),(6,12),(7,5),(7,9),(8,4),(8,6),(9,11),(9,13),(10,14),(11,10),(12,3),(12,9),(13,1),(13,10),(14,2)],15)
=> ([(4,12),(5,11),(6,13),(6,14),(7,9),(7,14),(8,10),(8,14),(9,11),(9,13),(10,12),(10,13),(11,14),(12,14),(13,14)],15)
=> ?
=> ?
=> ? = 0
([(0,5),(1,8),(2,7),(3,2),(3,6),(4,1),(4,6),(5,3),(5,4),(6,7),(6,8),(7,9),(8,9)],10)
=> ([(3,6),(3,9),(4,5),(4,9),(5,8),(6,8),(7,8),(7,9),(8,9)],10)
=> ?
=> ?
=> ? = 0
([(0,6),(1,9),(1,10),(2,8),(3,7),(4,3),(4,12),(5,2),(5,12),(6,4),(6,5),(7,9),(7,11),(8,10),(8,11),(9,13),(10,13),(11,13),(12,1),(12,7),(12,8)],14)
=> ([(3,12),(3,13),(4,5),(4,13),(5,12),(6,9),(6,10),(6,11),(7,8),(7,10),(7,11),(7,12),(8,9),(8,11),(8,13),(9,10),(9,12),(10,13),(11,12),(11,13),(12,13)],14)
=> ?
=> ?
=> ? = 0
([(0,7),(1,11),(1,14),(2,10),(3,8),(4,9),(5,3),(5,13),(6,4),(6,13),(7,5),(7,6),(8,12),(8,14),(9,11),(9,12),(11,15),(12,15),(13,1),(13,8),(13,9),(14,2),(14,15),(15,10)],16)
=> ([(3,13),(4,14),(4,15),(5,6),(5,15),(6,14),(7,10),(7,11),(7,12),(7,15),(8,9),(8,11),(8,12),(8,13),(9,10),(9,12),(9,15),(10,11),(10,13),(10,14),(11,14),(11,15),(12,13),(12,14),(13,15),(14,15)],16)
=> ?
=> ?
=> ? = 0
([(0,5),(0,6),(1,8),(2,9),(3,8),(3,9),(4,1),(5,4),(6,7),(7,2),(7,3),(8,10),(9,10)],11)
=> ([(2,6),(2,10),(3,7),(3,8),(3,9),(4,7),(4,8),(4,9),(5,7),(5,8),(5,9),(5,10),(6,7),(6,8),(6,9),(7,10),(8,10),(9,10)],11)
=> ?
=> ?
=> ? = 0
([(0,6),(0,7),(1,9),(2,12),(3,9),(3,12),(4,10),(5,1),(6,5),(7,8),(8,2),(8,3),(9,11),(11,10),(12,4),(12,11)],13)
=> ([(2,9),(3,10),(3,11),(3,12),(4,10),(4,11),(4,12),(5,6),(5,8),(5,9),(6,10),(6,11),(6,12),(7,8),(7,10),(7,11),(7,12),(8,10),(8,11),(8,12),(9,10),(9,11),(9,12)],13)
=> ?
=> ?
=> ? = 0
([(0,6),(0,7),(1,9),(2,8),(3,5),(4,2),(5,1),(5,8),(6,3),(7,4),(8,9)],10)
=> ([(2,9),(3,6),(3,7),(3,8),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,9),(7,9),(8,9)],10)
=> ?
=> ?
=> ? = 0
([(0,9),(0,10),(1,11),(2,14),(3,12),(4,13),(5,4),(5,11),(6,5),(7,3),(8,1),(8,14),(9,6),(10,2),(10,8),(11,13),(13,12),(14,7)],15)
=> ([(2,9),(2,10),(2,11),(2,14),(3,6),(3,7),(3,8),(3,13),(4,6),(4,7),(4,8),(4,13),(4,14),(5,9),(5,10),(5,11),(5,13),(5,14),(6,9),(6,10),(6,11),(6,12),(6,14),(7,9),(7,10),(7,11),(7,12),(7,14),(8,9),(8,10),(8,11),(8,12),(8,14),(9,12),(9,13),(10,12),(10,13),(11,12),(11,13),(12,13),(12,14),(13,14)],15)
=> ?
=> ?
=> ? = 0
([(0,6),(1,7),(2,8),(3,4),(3,7),(4,5),(4,10),(5,2),(5,9),(6,1),(6,3),(7,10),(9,8),(10,9)],11)
=> ([(3,10),(4,9),(5,8),(5,9),(6,7),(6,10),(7,8),(7,9),(8,10),(9,10)],11)
=> ?
=> ?
=> ? = 0
([(0,7),(1,14),(2,9),(3,10),(4,5),(4,14),(5,6),(5,8),(6,2),(6,11),(7,1),(7,4),(8,10),(8,11),(9,13),(10,12),(11,9),(11,12),(12,13),(14,3),(14,8)],15)
=> ([(3,11),(4,9),(4,14),(5,6),(5,11),(5,13),(6,12),(6,14),(7,12),(7,13),(7,14),(8,10),(8,13),(8,14),(9,10),(9,13),(10,12),(10,14),(11,12),(11,14),(12,13),(13,14)],15)
=> ?
=> ?
=> ? = 0
([(0,6),(1,9),(2,8),(3,5),(3,7),(4,1),(4,7),(5,2),(5,10),(6,3),(6,4),(7,9),(7,10),(8,12),(9,11),(10,8),(10,11),(11,12)],13)
=> ([(3,8),(3,12),(4,7),(4,11),(5,9),(5,11),(5,12),(6,10),(6,11),(6,12),(7,9),(7,12),(8,10),(8,11),(9,10),(9,11),(10,12),(11,12)],13)
=> ?
=> ?
=> ? = 0
Description
The minimal number of occurrences of the comparability-pattern in a linear ordering of the vertices of the graph. A graph is a comparability graph if and only if in any linear ordering of its vertices, there are no three vertices $a < b < c$ such that $(a,b)$ and $(b,c)$ are edges and $(a,c)$ is not an edge. This statistic is the minimal number of occurrences of this pattern, in the set of all linear orderings of the vertices.
Mp00110: Posets Greene-Kleitman invariantInteger partitions
Mp00322: Integer partitions Loehr-WarringtonInteger partitions
Mp00043: Integer partitions to Dyck pathDyck paths
St001107: Dyck paths ⟶ ℤResult quality: 50% values known / values provided: 92%distinct values known / distinct values provided: 50%
Values
([(0,1)],2)
=> [2]
=> [1,1]
=> [1,0,1,1,0,0]
=> 0
([(0,1),(0,2)],3)
=> [2,1]
=> [3]
=> [1,1,1,0,0,0,1,0]
=> 0
([(0,2),(2,1)],3)
=> [3]
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0
([(0,2),(1,2)],3)
=> [2,1]
=> [3]
=> [1,1,1,0,0,0,1,0]
=> 0
([(0,1),(0,2),(0,3)],4)
=> [2,1,1]
=> [2,2]
=> [1,1,0,0,1,1,0,0]
=> 0
([(0,2),(0,3),(3,1)],4)
=> [3,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 0
([(0,1),(0,2),(1,3),(2,3)],4)
=> [3,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 0
([(0,3),(3,1),(3,2)],4)
=> [3,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 0
([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 0
([(0,3),(1,3),(2,3)],4)
=> [2,1,1]
=> [2,2]
=> [1,1,0,0,1,1,0,0]
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> [2,2]
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0
([(0,3),(2,1),(3,2)],4)
=> [4]
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0
([(0,3),(1,2),(2,3)],4)
=> [3,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 0
([(0,1),(0,2),(0,3),(0,4)],5)
=> [2,1,1,1]
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 0
([(0,2),(0,3),(0,4),(4,1)],5)
=> [3,1,1]
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 0
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 0
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 0
([(0,3),(0,4),(4,1),(4,2)],5)
=> [3,1,1]
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [4,1]
=> [2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> 0
([(0,3),(0,4),(3,2),(4,1)],5)
=> [3,2]
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 0
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> [3,2]
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 0
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [3,2]
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 0
([(0,4),(4,1),(4,2),(4,3)],5)
=> [3,1,1]
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 0
([(0,4),(1,4),(4,2),(4,3)],5)
=> [3,2]
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 0
([(0,4),(1,4),(2,4),(4,3)],5)
=> [3,1,1]
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> [2,1,1,1]
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [2,2,1]
=> [2,2,1]
=> [1,0,1,0,1,1,0,0]
=> 0
([(0,4),(1,4),(2,3),(4,2)],5)
=> [4,1]
=> [2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> 0
([(0,4),(1,3),(2,3),(3,4)],5)
=> [3,1,1]
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> [3,1,1]
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 0
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> [3,2]
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 0
([(0,3),(0,4),(1,3),(1,4),(4,2)],5)
=> [3,2]
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 0
([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> [3,2]
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 0
([(0,2),(0,4),(3,1),(4,3)],5)
=> [4,1]
=> [2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> 0
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> [4,1]
=> [2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4)],5)
=> [2,2,1]
=> [2,2,1]
=> [1,0,1,0,1,1,0,0]
=> 0
([(0,3),(0,4),(1,2),(2,3),(2,4)],5)
=> [3,2]
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 0
([(0,3),(3,4),(4,1),(4,2)],5)
=> [4,1]
=> [2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> 0
([(0,4),(1,2),(2,4),(4,3)],5)
=> [4,1]
=> [2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> 0
([(0,4),(3,2),(4,1),(4,3)],5)
=> [4,1]
=> [2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> 0
([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 0
([(0,3),(1,2),(2,4),(3,4)],5)
=> [3,2]
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 0
([(0,4),(1,2),(2,3),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [4,1]
=> [2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> 0
([(0,1),(0,2),(0,3),(0,4),(0,5)],6)
=> [2,1,1,1,1]
=> [4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> 0
([(0,2),(0,3),(0,4),(0,5),(5,1)],6)
=> [3,1,1,1]
=> [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0
([(0,1),(0,2),(0,3),(0,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0
([(0,1),(0,2),(0,3),(0,4),(2,5),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0
([(0,3),(0,4),(3,5),(3,6),(4,5),(4,6),(5,2),(6,1)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,2),(0,3),(2,4),(2,6),(3,4),(3,6),(4,5),(6,1),(6,5)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,1),(0,2),(1,5),(1,6),(2,5),(2,6),(5,3),(5,4),(6,3),(6,4)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 1
([(0,6),(1,6),(4,3),(5,2),(6,4),(6,5)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,6),(1,6),(3,5),(4,2),(4,5),(6,3),(6,4)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,6),(1,6),(2,4),(2,5),(3,4),(3,5),(6,2),(6,3)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 1
([(0,5),(0,6),(1,5),(1,6),(2,4),(3,4),(5,3),(6,2)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,5),(0,6),(1,5),(1,6),(2,3),(4,3),(5,4),(6,2),(6,4)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,5),(0,6),(1,5),(1,6),(3,2),(4,2),(5,3),(5,4),(6,3),(6,4)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 1
([(0,5),(1,4),(1,5),(4,6),(5,6),(6,2),(6,3)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,6),(1,2),(1,6),(2,3),(3,4),(3,5),(6,4),(6,5)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,5),(0,6),(1,5),(1,6),(4,3),(5,4),(6,2)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,5),(0,6),(1,5),(1,6),(2,3),(5,4),(6,2),(6,4)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,5),(0,6),(1,5),(1,6),(4,2),(5,3),(5,4),(6,3),(6,4)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,5),(0,6),(1,5),(1,6),(2,4),(5,2),(5,3),(6,3),(6,4)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,5),(0,6),(1,5),(1,6),(4,3),(5,4),(6,2),(6,4)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,5),(0,6),(1,5),(1,6),(3,4),(5,3),(6,2),(6,4)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,5),(0,6),(1,5),(1,6),(4,2),(4,3),(5,4),(6,4)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 1
([(0,5),(0,6),(1,5),(1,6),(3,2),(3,4),(5,3),(6,4)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,5),(0,6),(1,5),(1,6),(2,3),(2,4),(5,2),(6,3),(6,4)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,3),(0,4),(1,5),(1,6),(2,5),(2,6),(3,2),(4,1)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,2),(0,4),(2,5),(3,1),(3,6),(4,3),(4,5),(5,6)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,2),(0,3),(1,5),(1,6),(2,4),(3,1),(3,4),(4,5),(4,6)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,3),(0,5),(3,6),(4,1),(5,4),(5,6),(6,2)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,3),(0,4),(2,5),(3,6),(4,2),(4,6),(6,1),(6,5)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,2),(0,3),(1,4),(1,6),(2,4),(2,5),(3,1),(3,5),(5,6)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,3),(0,4),(2,5),(3,5),(3,6),(4,2),(4,6),(6,1)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,2),(1,3),(1,6),(2,6),(3,4),(3,5),(6,4),(6,5)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,3),(1,2),(1,5),(2,6),(3,5),(3,6),(5,4),(6,4)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,2),(0,6),(1,5),(1,6),(2,5),(5,3),(5,4),(6,3),(6,4)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,3),(0,6),(1,2),(1,5),(2,6),(3,5),(5,4),(6,4)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,5),(0,6),(1,2),(2,5),(2,6),(5,4),(6,3)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,3),(1,5),(1,6),(3,5),(3,6),(5,4),(6,2),(6,4)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,2),(1,5),(1,6),(2,5),(2,6),(5,3),(5,4),(6,3),(6,4)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,2),(1,6),(2,3),(2,6),(3,4),(3,5),(6,4),(6,5)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,5),(1,4),(4,6),(5,6),(6,2),(6,3)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,4),(1,3),(3,5),(3,6),(4,5),(4,6),(6,2)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,3),(1,2),(2,5),(2,6),(3,5),(3,6),(5,4),(6,4)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,6),(1,3),(1,6),(3,4),(3,5),(5,2),(6,4),(6,5)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,6),(1,3),(1,6),(2,4),(3,2),(3,5),(5,4),(6,5)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,6),(1,2),(1,6),(2,4),(2,5),(4,3),(5,3),(6,4),(6,5)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,6),(1,4),(1,6),(2,5),(3,5),(4,3),(6,2)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,6),(1,3),(1,6),(2,4),(3,5),(5,4),(6,2),(6,5)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,6),(1,3),(1,6),(2,4),(2,5),(3,4),(3,5),(6,2)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,4),(0,5),(2,6),(3,1),(3,6),(4,2),(5,3)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,3),(0,4),(1,5),(2,5),(2,6),(3,2),(4,1),(4,6)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,5),(0,6),(3,2),(4,1),(5,3),(6,4)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,4),(0,5),(2,6),(3,1),(4,2),(5,3),(5,6)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,3),(0,4),(1,6),(2,5),(3,2),(3,6),(4,1),(4,5)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
([(0,2),(0,6),(1,5),(1,6),(2,4),(2,5),(4,3),(5,3),(6,4)],7)
=> [4,3]
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 0
Description
The number of times one can erase the first up and the last down step in a Dyck path and still remain a Dyck path. In other words, this is the lowest height of a valley of a Dyck path, or its semilength in case of the unique path without valleys.
Mp00198: Posets incomparability graphGraphs
Mp00147: Graphs squareGraphs
Mp00111: Graphs complementGraphs
St001367: Graphs ⟶ ℤResult quality: 50% values known / values provided: 92%distinct values known / distinct values provided: 50%
Values
([(0,1)],2)
=> ([],2)
=> ([],2)
=> ([(0,1)],2)
=> 0
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,2),(2,1)],3)
=> ([],3)
=> ([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 0
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 0
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> ([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(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)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 0
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 0
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(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)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 0
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,3),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,3),(0,4),(1,3),(1,4),(4,2)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 0
([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 0
([(0,2),(0,4),(3,1),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 0
([(0,3),(0,4),(1,2),(2,3),(2,4)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 0
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(3,4)],5)
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(3,2),(4,1),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> ([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,1),(0,2),(0,3),(0,4),(0,5)],6)
=> ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(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)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 0
([(0,2),(0,3),(0,4),(0,5),(5,1)],6)
=> ([(1,3),(1,4),(1,5),(2,3),(2,4),(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)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 0
([(0,1),(0,2),(0,3),(0,4),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,4),(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)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 0
([(0,1),(0,2),(0,3),(0,4),(2,5),(3,5),(4,5)],6)
=> ([(1,5),(2,3),(2,4),(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)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 0
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
([(0,2),(0,3),(2,4),(2,5),(3,4),(3,5),(4,6),(5,6),(6,1)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> ? = 0
([(0,1),(0,2),(1,5),(1,6),(2,5),(2,6),(5,3),(5,4),(6,3),(6,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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
([(0,6),(1,6),(2,5),(3,5),(4,2),(4,3),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> ? = 0
([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> ? = 0
([(0,6),(1,6),(4,5),(5,2),(5,3),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> ? = 0
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> ([(5,6)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> ? = 0
([(0,6),(1,6),(3,4),(4,2),(5,3),(6,5)],7)
=> ([(5,6)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> ? = 0
([(0,6),(1,6),(2,5),(3,5),(5,4),(6,2),(6,3)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> ? = 0
([(0,6),(1,6),(2,4),(2,5),(3,4),(3,5),(6,2),(6,3)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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
([(0,5),(0,6),(1,5),(1,6),(3,2),(4,2),(5,3),(5,4),(6,3),(6,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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
([(0,5),(0,6),(1,5),(1,6),(4,2),(4,3),(5,4),(6,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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
([(0,5),(0,6),(1,5),(1,6),(2,3),(4,2),(5,4),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> ? = 0
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
=> ([(5,6)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> ? = 0
([(0,3),(0,4),(3,6),(4,6),(5,1),(5,2),(6,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> ? = 0
([(0,3),(1,4),(1,5),(2,4),(2,5),(3,1),(3,2),(4,6),(5,6)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> ? = 0
([(0,5),(1,6),(2,6),(5,1),(5,2),(6,3),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> ? = 0
([(0,3),(1,5),(1,6),(2,5),(2,6),(3,4),(4,1),(4,2)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> ? = 0
([(0,5),(3,4),(4,6),(5,3),(6,1),(6,2)],7)
=> ([(5,6)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> ? = 0
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> ([],7)
=> ([],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> ? = 0
([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
=> ([(5,6)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> ? = 0
([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
=> ([(5,6)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> ? = 0
([(0,7),(2,4),(3,2),(4,6),(5,3),(6,1),(7,5)],8)
=> ([],8)
=> ?
=> ?
=> ? = 0
([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
=> ([(2,7),(3,5),(3,8),(4,6),(4,8),(5,6),(5,7),(6,8),(7,8)],9)
=> ?
=> ?
=> ? = 0
([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
=> ([(1,2),(1,7),(1,9),(2,6),(2,8),(3,4),(3,6),(3,8),(3,9),(4,7),(4,8),(4,9),(5,6),(5,7),(5,8),(5,9),(6,7),(6,9),(7,8),(8,9)],10)
=> ?
=> ?
=> ? = 0
([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
=> ([(2,10),(3,6),(3,10),(3,13),(4,9),(4,11),(4,14),(4,15),(5,12),(5,13),(5,14),(5,15),(6,12),(6,14),(6,15),(7,8),(7,9),(7,12),(7,14),(7,15),(8,11),(8,13),(8,14),(8,15),(9,11),(9,13),(9,15),(10,12),(10,14),(10,15),(11,12),(11,14),(11,15),(12,13),(13,14),(13,15)],16)
=> ?
=> ?
=> ? = 0
([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
=> ([(2,9),(2,10),(2,11),(3,4),(3,5),(3,8),(3,11),(4,5),(4,7),(4,10),(5,6),(5,9),(6,7),(6,8),(6,10),(6,11),(7,8),(7,9),(7,11),(8,9),(8,10),(9,10),(9,11),(10,11)],12)
=> ?
=> ?
=> ? = 0
([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
=> ([(1,2),(1,10),(1,12),(1,14),(2,9),(2,11),(2,13),(3,7),(3,8),(3,11),(3,12),(3,13),(3,14),(4,9),(4,10),(4,11),(4,12),(4,13),(4,14),(5,6),(5,8),(5,9),(5,11),(5,12),(5,13),(5,14),(6,7),(6,10),(6,11),(6,12),(6,13),(6,14),(7,8),(7,9),(7,11),(7,13),(7,14),(8,10),(8,12),(8,13),(8,14),(9,10),(9,12),(9,14),(10,11),(10,13),(11,12),(11,14),(12,13),(13,14)],15)
=> ?
=> ?
=> ? = 0
([(0,4),(1,6),(2,5),(3,5),(3,6),(4,1),(4,2),(4,3),(5,7),(6,7)],8)
=> ([(3,6),(3,7),(4,5),(4,7),(5,6),(6,7)],8)
=> ?
=> ?
=> ? = 0
([(0,5),(1,7),(2,7),(3,6),(4,6),(5,1),(5,2),(7,3),(7,4)],8)
=> ([(4,7),(5,6)],8)
=> ?
=> ?
=> ? = 0
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,6),(4,7),(5,7),(7,6)],8)
=> ([(2,7),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ?
=> ? = 0
([(0,3),(0,4),(1,6),(2,6),(3,7),(4,7),(5,1),(5,2),(7,5)],8)
=> ([(4,7),(5,6)],8)
=> ?
=> ?
=> ? = 0
([(0,4),(0,5),(1,6),(2,6),(4,7),(5,7),(6,3),(7,1),(7,2)],8)
=> ([(4,7),(5,6)],8)
=> ?
=> ?
=> ? = 0
([(0,3),(0,5),(1,7),(3,6),(4,2),(5,1),(5,6),(6,7),(7,4)],8)
=> ([(4,7),(5,6),(6,7)],8)
=> ?
=> ?
=> ? = 0
([(0,5),(2,7),(3,6),(4,2),(4,6),(5,3),(5,4),(6,7),(7,1)],8)
=> ([(4,7),(5,6),(6,7)],8)
=> ?
=> ?
=> ? = 0
([(0,5),(0,6),(1,7),(2,7),(3,2),(4,1),(5,3),(6,4)],8)
=> ([(2,5),(2,6),(2,7),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7)],8)
=> ?
=> ?
=> ? = 0
([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
=> ([(4,7),(5,6),(6,7)],8)
=> ?
=> ?
=> ? = 0
([(0,5),(1,6),(2,7),(3,4),(3,6),(4,2),(4,8),(5,1),(5,3),(6,8),(8,7)],9)
=> ([(3,8),(4,7),(5,6),(5,7),(6,8),(7,8)],9)
=> ?
=> ?
=> ? = 0
([(0,5),(1,7),(2,8),(3,6),(4,3),(4,8),(5,2),(5,4),(6,7),(8,1),(8,6)],9)
=> ([(3,8),(4,7),(5,6),(6,8),(7,8)],9)
=> ?
=> ?
=> ? = 0
([(0,3),(0,5),(2,8),(3,6),(4,2),(4,7),(5,4),(5,6),(6,7),(7,8),(8,1)],9)
=> ([(3,8),(4,7),(5,6),(5,7),(6,8),(7,8)],9)
=> ?
=> ?
=> ? = 0
([(0,4),(0,5),(1,6),(3,7),(4,8),(5,1),(5,8),(6,7),(7,2),(8,3),(8,6)],9)
=> ([(3,8),(4,7),(5,6),(6,8),(7,8)],9)
=> ?
=> ?
=> ? = 0
([(0,1),(0,2),(0,3),(0,4),(1,6),(1,7),(2,6),(2,7),(3,6),(3,7),(4,6),(4,7),(6,5),(7,5)],8)
=> ([(2,3),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ?
=> ? = 0
([(0,6),(1,7),(2,9),(4,8),(5,1),(5,9),(6,2),(6,5),(7,8),(8,3),(9,4),(9,7)],10)
=> ([(4,9),(5,8),(6,7),(7,9),(8,9)],10)
=> ?
=> ?
=> ? = 0
([(0,6),(1,11),(2,8),(3,9),(4,5),(4,11),(5,3),(5,7),(6,1),(6,4),(7,8),(7,9),(8,10),(9,10),(11,2),(11,7)],12)
=> ([(3,9),(4,5),(4,11),(5,10),(6,10),(6,11),(7,8),(7,11),(8,9),(8,10),(9,11),(10,11)],12)
=> ?
=> ?
=> ? = 0
([(0,7),(1,13),(2,12),(3,9),(4,11),(5,6),(5,12),(6,4),(6,8),(7,2),(7,5),(8,11),(8,13),(10,9),(11,10),(12,1),(12,8),(13,3),(13,10)],14)
=> ([(3,11),(4,10),(5,8),(5,13),(6,9),(6,13),(7,12),(7,13),(8,10),(8,12),(9,11),(9,12),(10,13),(11,13),(12,13)],14)
=> ?
=> ?
=> ? = 0
([(0,8),(1,14),(3,13),(4,12),(5,11),(6,7),(6,12),(7,5),(7,9),(8,4),(8,6),(9,11),(9,13),(10,14),(11,10),(12,3),(12,9),(13,1),(13,10),(14,2)],15)
=> ([(4,12),(5,11),(6,13),(6,14),(7,9),(7,14),(8,10),(8,14),(9,11),(9,13),(10,12),(10,13),(11,14),(12,14),(13,14)],15)
=> ?
=> ?
=> ? = 0
([(0,5),(1,8),(2,7),(3,2),(3,6),(4,1),(4,6),(5,3),(5,4),(6,7),(6,8),(7,9),(8,9)],10)
=> ([(3,6),(3,9),(4,5),(4,9),(5,8),(6,8),(7,8),(7,9),(8,9)],10)
=> ?
=> ?
=> ? = 0
([(0,6),(1,9),(1,10),(2,8),(3,7),(4,3),(4,12),(5,2),(5,12),(6,4),(6,5),(7,9),(7,11),(8,10),(8,11),(9,13),(10,13),(11,13),(12,1),(12,7),(12,8)],14)
=> ([(3,12),(3,13),(4,5),(4,13),(5,12),(6,9),(6,10),(6,11),(7,8),(7,10),(7,11),(7,12),(8,9),(8,11),(8,13),(9,10),(9,12),(10,13),(11,12),(11,13),(12,13)],14)
=> ?
=> ?
=> ? = 0
([(0,7),(1,11),(1,14),(2,10),(3,8),(4,9),(5,3),(5,13),(6,4),(6,13),(7,5),(7,6),(8,12),(8,14),(9,11),(9,12),(11,15),(12,15),(13,1),(13,8),(13,9),(14,2),(14,15),(15,10)],16)
=> ([(3,13),(4,14),(4,15),(5,6),(5,15),(6,14),(7,10),(7,11),(7,12),(7,15),(8,9),(8,11),(8,12),(8,13),(9,10),(9,12),(9,15),(10,11),(10,13),(10,14),(11,14),(11,15),(12,13),(12,14),(13,15),(14,15)],16)
=> ?
=> ?
=> ? = 0
([(0,5),(0,6),(1,8),(2,9),(3,8),(3,9),(4,1),(5,4),(6,7),(7,2),(7,3),(8,10),(9,10)],11)
=> ([(2,6),(2,10),(3,7),(3,8),(3,9),(4,7),(4,8),(4,9),(5,7),(5,8),(5,9),(5,10),(6,7),(6,8),(6,9),(7,10),(8,10),(9,10)],11)
=> ?
=> ?
=> ? = 0
([(0,6),(0,7),(1,9),(2,12),(3,9),(3,12),(4,10),(5,1),(6,5),(7,8),(8,2),(8,3),(9,11),(11,10),(12,4),(12,11)],13)
=> ([(2,9),(3,10),(3,11),(3,12),(4,10),(4,11),(4,12),(5,6),(5,8),(5,9),(6,10),(6,11),(6,12),(7,8),(7,10),(7,11),(7,12),(8,10),(8,11),(8,12),(9,10),(9,11),(9,12)],13)
=> ?
=> ?
=> ? = 0
Description
The smallest number which does not occur as degree of a vertex in a graph.
Mp00198: Posets incomparability graphGraphs
Mp00147: Graphs squareGraphs
Mp00111: Graphs complementGraphs
St001333: Graphs ⟶ ℤResult quality: 50% values known / values provided: 92%distinct values known / distinct values provided: 50%
Values
([(0,1)],2)
=> ([],2)
=> ([],2)
=> ([(0,1)],2)
=> 1 = 0 + 1
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,2),(2,1)],3)
=> ([],3)
=> ([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 1 = 0 + 1
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> ([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(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)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(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)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 1 = 0 + 1
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,4),(1,3),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,3),(0,4),(1,3),(1,4),(4,2)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 1 = 0 + 1
([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,2),(0,4),(3,1),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 1 = 0 + 1
([(0,3),(0,4),(1,2),(2,3),(2,4)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 1 = 0 + 1
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(3,4)],5)
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,4),(3,2),(4,1),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> ([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5)],6)
=> ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(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)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1 = 0 + 1
([(0,2),(0,3),(0,4),(0,5),(5,1)],6)
=> ([(1,3),(1,4),(1,5),(2,3),(2,4),(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)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,4),(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)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(2,5),(3,5),(4,5)],6)
=> ([(1,5),(2,3),(2,4),(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)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1 = 0 + 1
([(0,2),(0,3),(2,4),(2,5),(3,4),(3,5),(4,6),(5,6),(6,1)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> ? = 0 + 1
([(0,1),(0,2),(1,5),(1,6),(2,5),(2,6),(5,3),(5,4),(6,3),(6,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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 + 1
([(0,6),(1,6),(2,5),(3,5),(4,2),(4,3),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> ? = 0 + 1
([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> ? = 0 + 1
([(0,6),(1,6),(4,5),(5,2),(5,3),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> ? = 0 + 1
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> ([(5,6)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> ? = 0 + 1
([(0,6),(1,6),(3,4),(4,2),(5,3),(6,5)],7)
=> ([(5,6)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> ? = 0 + 1
([(0,6),(1,6),(2,5),(3,5),(5,4),(6,2),(6,3)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> ? = 0 + 1
([(0,6),(1,6),(2,4),(2,5),(3,4),(3,5),(6,2),(6,3)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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 + 1
([(0,5),(0,6),(1,5),(1,6),(3,2),(4,2),(5,3),(5,4),(6,3),(6,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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 + 1
([(0,5),(0,6),(1,5),(1,6),(4,2),(4,3),(5,4),(6,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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 + 1
([(0,5),(0,6),(1,5),(1,6),(2,3),(4,2),(5,4),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> ? = 0 + 1
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
=> ([(5,6)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> ? = 0 + 1
([(0,3),(0,4),(3,6),(4,6),(5,1),(5,2),(6,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> ? = 0 + 1
([(0,3),(1,4),(1,5),(2,4),(2,5),(3,1),(3,2),(4,6),(5,6)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> ? = 0 + 1
([(0,5),(1,6),(2,6),(5,1),(5,2),(6,3),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> ? = 0 + 1
([(0,3),(1,5),(1,6),(2,5),(2,6),(3,4),(4,1),(4,2)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> ? = 0 + 1
([(0,5),(3,4),(4,6),(5,3),(6,1),(6,2)],7)
=> ([(5,6)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> ? = 0 + 1
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> ([],7)
=> ([],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> ? = 0 + 1
([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
=> ([(5,6)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> ? = 0 + 1
([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
=> ([(5,6)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> ? = 0 + 1
([(0,7),(2,4),(3,2),(4,6),(5,3),(6,1),(7,5)],8)
=> ([],8)
=> ?
=> ?
=> ? = 0 + 1
([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
=> ([(2,7),(3,5),(3,8),(4,6),(4,8),(5,6),(5,7),(6,8),(7,8)],9)
=> ?
=> ?
=> ? = 0 + 1
([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
=> ([(1,2),(1,7),(1,9),(2,6),(2,8),(3,4),(3,6),(3,8),(3,9),(4,7),(4,8),(4,9),(5,6),(5,7),(5,8),(5,9),(6,7),(6,9),(7,8),(8,9)],10)
=> ?
=> ?
=> ? = 0 + 1
([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
=> ([(2,10),(3,6),(3,10),(3,13),(4,9),(4,11),(4,14),(4,15),(5,12),(5,13),(5,14),(5,15),(6,12),(6,14),(6,15),(7,8),(7,9),(7,12),(7,14),(7,15),(8,11),(8,13),(8,14),(8,15),(9,11),(9,13),(9,15),(10,12),(10,14),(10,15),(11,12),(11,14),(11,15),(12,13),(13,14),(13,15)],16)
=> ?
=> ?
=> ? = 0 + 1
([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
=> ([(2,9),(2,10),(2,11),(3,4),(3,5),(3,8),(3,11),(4,5),(4,7),(4,10),(5,6),(5,9),(6,7),(6,8),(6,10),(6,11),(7,8),(7,9),(7,11),(8,9),(8,10),(9,10),(9,11),(10,11)],12)
=> ?
=> ?
=> ? = 0 + 1
([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
=> ([(1,2),(1,10),(1,12),(1,14),(2,9),(2,11),(2,13),(3,7),(3,8),(3,11),(3,12),(3,13),(3,14),(4,9),(4,10),(4,11),(4,12),(4,13),(4,14),(5,6),(5,8),(5,9),(5,11),(5,12),(5,13),(5,14),(6,7),(6,10),(6,11),(6,12),(6,13),(6,14),(7,8),(7,9),(7,11),(7,13),(7,14),(8,10),(8,12),(8,13),(8,14),(9,10),(9,12),(9,14),(10,11),(10,13),(11,12),(11,14),(12,13),(13,14)],15)
=> ?
=> ?
=> ? = 0 + 1
([(0,4),(1,6),(2,5),(3,5),(3,6),(4,1),(4,2),(4,3),(5,7),(6,7)],8)
=> ([(3,6),(3,7),(4,5),(4,7),(5,6),(6,7)],8)
=> ?
=> ?
=> ? = 0 + 1
([(0,5),(1,7),(2,7),(3,6),(4,6),(5,1),(5,2),(7,3),(7,4)],8)
=> ([(4,7),(5,6)],8)
=> ?
=> ?
=> ? = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,6),(4,7),(5,7),(7,6)],8)
=> ([(2,7),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ?
=> ? = 0 + 1
([(0,3),(0,4),(1,6),(2,6),(3,7),(4,7),(5,1),(5,2),(7,5)],8)
=> ([(4,7),(5,6)],8)
=> ?
=> ?
=> ? = 0 + 1
([(0,4),(0,5),(1,6),(2,6),(4,7),(5,7),(6,3),(7,1),(7,2)],8)
=> ([(4,7),(5,6)],8)
=> ?
=> ?
=> ? = 0 + 1
([(0,3),(0,5),(1,7),(3,6),(4,2),(5,1),(5,6),(6,7),(7,4)],8)
=> ([(4,7),(5,6),(6,7)],8)
=> ?
=> ?
=> ? = 0 + 1
([(0,5),(2,7),(3,6),(4,2),(4,6),(5,3),(5,4),(6,7),(7,1)],8)
=> ([(4,7),(5,6),(6,7)],8)
=> ?
=> ?
=> ? = 0 + 1
([(0,5),(0,6),(1,7),(2,7),(3,2),(4,1),(5,3),(6,4)],8)
=> ([(2,5),(2,6),(2,7),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7)],8)
=> ?
=> ?
=> ? = 0 + 1
([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
=> ([(4,7),(5,6),(6,7)],8)
=> ?
=> ?
=> ? = 0 + 1
([(0,5),(1,6),(2,7),(3,4),(3,6),(4,2),(4,8),(5,1),(5,3),(6,8),(8,7)],9)
=> ([(3,8),(4,7),(5,6),(5,7),(6,8),(7,8)],9)
=> ?
=> ?
=> ? = 0 + 1
([(0,5),(1,7),(2,8),(3,6),(4,3),(4,8),(5,2),(5,4),(6,7),(8,1),(8,6)],9)
=> ([(3,8),(4,7),(5,6),(6,8),(7,8)],9)
=> ?
=> ?
=> ? = 0 + 1
([(0,3),(0,5),(2,8),(3,6),(4,2),(4,7),(5,4),(5,6),(6,7),(7,8),(8,1)],9)
=> ([(3,8),(4,7),(5,6),(5,7),(6,8),(7,8)],9)
=> ?
=> ?
=> ? = 0 + 1
([(0,4),(0,5),(1,6),(3,7),(4,8),(5,1),(5,8),(6,7),(7,2),(8,3),(8,6)],9)
=> ([(3,8),(4,7),(5,6),(6,8),(7,8)],9)
=> ?
=> ?
=> ? = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,6),(1,7),(2,6),(2,7),(3,6),(3,7),(4,6),(4,7),(6,5),(7,5)],8)
=> ([(2,3),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ?
=> ?
=> ? = 0 + 1
([(0,6),(1,7),(2,9),(4,8),(5,1),(5,9),(6,2),(6,5),(7,8),(8,3),(9,4),(9,7)],10)
=> ([(4,9),(5,8),(6,7),(7,9),(8,9)],10)
=> ?
=> ?
=> ? = 0 + 1
([(0,6),(1,11),(2,8),(3,9),(4,5),(4,11),(5,3),(5,7),(6,1),(6,4),(7,8),(7,9),(8,10),(9,10),(11,2),(11,7)],12)
=> ([(3,9),(4,5),(4,11),(5,10),(6,10),(6,11),(7,8),(7,11),(8,9),(8,10),(9,11),(10,11)],12)
=> ?
=> ?
=> ? = 0 + 1
([(0,7),(1,13),(2,12),(3,9),(4,11),(5,6),(5,12),(6,4),(6,8),(7,2),(7,5),(8,11),(8,13),(10,9),(11,10),(12,1),(12,8),(13,3),(13,10)],14)
=> ([(3,11),(4,10),(5,8),(5,13),(6,9),(6,13),(7,12),(7,13),(8,10),(8,12),(9,11),(9,12),(10,13),(11,13),(12,13)],14)
=> ?
=> ?
=> ? = 0 + 1
([(0,8),(1,14),(3,13),(4,12),(5,11),(6,7),(6,12),(7,5),(7,9),(8,4),(8,6),(9,11),(9,13),(10,14),(11,10),(12,3),(12,9),(13,1),(13,10),(14,2)],15)
=> ([(4,12),(5,11),(6,13),(6,14),(7,9),(7,14),(8,10),(8,14),(9,11),(9,13),(10,12),(10,13),(11,14),(12,14),(13,14)],15)
=> ?
=> ?
=> ? = 0 + 1
([(0,5),(1,8),(2,7),(3,2),(3,6),(4,1),(4,6),(5,3),(5,4),(6,7),(6,8),(7,9),(8,9)],10)
=> ([(3,6),(3,9),(4,5),(4,9),(5,8),(6,8),(7,8),(7,9),(8,9)],10)
=> ?
=> ?
=> ? = 0 + 1
([(0,6),(1,9),(1,10),(2,8),(3,7),(4,3),(4,12),(5,2),(5,12),(6,4),(6,5),(7,9),(7,11),(8,10),(8,11),(9,13),(10,13),(11,13),(12,1),(12,7),(12,8)],14)
=> ([(3,12),(3,13),(4,5),(4,13),(5,12),(6,9),(6,10),(6,11),(7,8),(7,10),(7,11),(7,12),(8,9),(8,11),(8,13),(9,10),(9,12),(10,13),(11,12),(11,13),(12,13)],14)
=> ?
=> ?
=> ? = 0 + 1
([(0,7),(1,11),(1,14),(2,10),(3,8),(4,9),(5,3),(5,13),(6,4),(6,13),(7,5),(7,6),(8,12),(8,14),(9,11),(9,12),(11,15),(12,15),(13,1),(13,8),(13,9),(14,2),(14,15),(15,10)],16)
=> ([(3,13),(4,14),(4,15),(5,6),(5,15),(6,14),(7,10),(7,11),(7,12),(7,15),(8,9),(8,11),(8,12),(8,13),(9,10),(9,12),(9,15),(10,11),(10,13),(10,14),(11,14),(11,15),(12,13),(12,14),(13,15),(14,15)],16)
=> ?
=> ?
=> ? = 0 + 1
([(0,5),(0,6),(1,8),(2,9),(3,8),(3,9),(4,1),(5,4),(6,7),(7,2),(7,3),(8,10),(9,10)],11)
=> ([(2,6),(2,10),(3,7),(3,8),(3,9),(4,7),(4,8),(4,9),(5,7),(5,8),(5,9),(5,10),(6,7),(6,8),(6,9),(7,10),(8,10),(9,10)],11)
=> ?
=> ?
=> ? = 0 + 1
([(0,6),(0,7),(1,9),(2,12),(3,9),(3,12),(4,10),(5,1),(6,5),(7,8),(8,2),(8,3),(9,11),(11,10),(12,4),(12,11)],13)
=> ([(2,9),(3,10),(3,11),(3,12),(4,10),(4,11),(4,12),(5,6),(5,8),(5,9),(6,10),(6,11),(6,12),(7,8),(7,10),(7,11),(7,12),(8,10),(8,11),(8,12),(9,10),(9,11),(9,12)],13)
=> ?
=> ?
=> ? = 0 + 1
Description
The cardinality of a minimal edge-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 only the graph with one edge.
Mp00198: Posets incomparability graphGraphs
Mp00147: Graphs squareGraphs
St000264: Graphs ⟶ ℤResult quality: 50% values known / values provided: 89%distinct values known / distinct values provided: 50%
Values
([(0,1)],2)
=> ([],2)
=> ([],2)
=> ? = 0 + 3
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0 + 3
([(0,2),(2,1)],3)
=> ([],3)
=> ([],3)
=> ? = 0 + 3
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0 + 3
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 3 = 0 + 3
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 3 = 0 + 3
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(2,3)],4)
=> ? = 0 + 3
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> ([(2,3)],4)
=> ? = 0 + 3
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(2,3)],4)
=> ? = 0 + 3
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 3 = 0 + 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> ? = 0 + 3
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> ([],4)
=> ? = 0 + 3
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 3 = 0 + 3
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(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 = 0 + 3
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(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 = 0 + 3
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> ([(3,4)],5)
=> ? = 0 + 3
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ? = 0 + 3
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ? = 0 + 3
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(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 = 0 + 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(3,4)],5)
=> ? = 0 + 3
([(0,4),(1,3),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(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 = 0 + 3
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
([(0,3),(0,4),(1,3),(1,4),(4,2)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ? = 0 + 3
([(0,2),(0,4),(3,1),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
([(0,3),(0,4),(1,2),(2,3),(2,4)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(3,4)],5)
=> ([(3,4)],5)
=> ? = 0 + 3
([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
([(0,4),(3,2),(4,1),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> ([],5)
=> ? = 0 + 3
([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> ([(3,4)],5)
=> ? = 0 + 3
([(0,1),(0,2),(0,3),(0,4),(0,5)],6)
=> ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(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 = 0 + 3
([(0,2),(0,3),(0,4),(0,5),(5,1)],6)
=> ([(1,3),(1,4),(1,5),(2,3),(2,4),(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 = 0 + 3
([(0,1),(0,2),(0,3),(0,4),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,4),(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 = 0 + 3
([(0,1),(0,2),(0,3),(0,4),(2,5),(3,5),(4,5)],6)
=> ([(1,5),(2,3),(2,4),(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 = 0 + 3
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 0 + 3
([(0,3),(0,4),(0,5),(5,1),(5,2)],6)
=> ([(1,4),(1,5),(2,3),(2,4),(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 = 0 + 3
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
=> ([(3,4),(3,5),(4,5)],6)
=> ([(3,4),(3,5),(4,5)],6)
=> 3 = 0 + 3
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,1)],6)
=> ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 0 + 3
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(3,5)],6)
=> ([(1,2),(1,5),(2,4),(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 = 0 + 3
([(0,1),(0,2),(0,3),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 0 + 3
([(0,1),(0,2),(0,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2),(3,4),(3,5),(4,5)],6)
=> ([(1,2),(3,4),(3,5),(4,5)],6)
=> 3 = 0 + 3
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,1),(4,5)],6)
=> ([(1,5),(2,3),(2,4),(3,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 = 0 + 3
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 0 + 3
([(0,2),(0,3),(0,4),(3,5),(4,5),(5,1)],6)
=> ([(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 = 0 + 3
([(0,3),(0,4),(0,5),(4,2),(5,1)],6)
=> ([(1,3),(1,4),(1,5),(2,3),(2,4),(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 = 0 + 3
([(0,2),(0,3),(0,4),(3,5),(4,1),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(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 = 0 + 3
([(0,1),(0,2),(0,3),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,4),(1,5),(2,3),(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 = 0 + 3
([(0,4),(0,5),(5,1),(5,2),(5,3)],6)
=> ([(1,5),(2,3),(2,4),(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 = 0 + 3
([(0,3),(0,4),(3,5),(4,5),(5,1),(5,2)],6)
=> ([(2,5),(3,4)],6)
=> ([(2,5),(3,4)],6)
=> ? = 0 + 3
([(0,2),(0,3),(2,4),(2,5),(3,4),(3,5),(5,1)],6)
=> ([(1,2),(3,5),(4,5)],6)
=> ([(1,2),(3,4),(3,5),(4,5)],6)
=> 3 = 0 + 3
([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
=> ([(2,5),(3,4)],6)
=> ([(2,5),(3,4)],6)
=> ? = 0 + 3
([(0,3),(0,4),(3,5),(4,1),(4,5),(5,2)],6)
=> ([(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 = 0 + 3
([(0,4),(0,5),(4,3),(5,1),(5,2)],6)
=> ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 0 + 3
([(0,3),(0,4),(3,5),(4,1),(4,2),(4,5)],6)
=> ([(1,5),(2,3),(2,4),(3,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 = 0 + 3
([(0,5),(1,5),(4,2),(4,3),(5,4)],6)
=> ([(2,5),(3,4)],6)
=> ([(2,5),(3,4)],6)
=> ? = 0 + 3
([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> ([(4,5)],6)
=> ? = 0 + 3
([(0,4),(1,4),(2,5),(3,5),(4,2),(4,3)],6)
=> ([(2,5),(3,4)],6)
=> ([(2,5),(3,4)],6)
=> ? = 0 + 3
([(0,4),(0,5),(1,4),(1,5),(4,2),(4,3),(5,2),(5,3)],6)
=> ([(0,5),(1,4),(2,3)],6)
=> ([(0,5),(1,4),(2,3)],6)
=> ? = 0 + 3
([(0,4),(0,5),(1,4),(1,5),(3,2),(4,3),(5,3)],6)
=> ([(2,5),(3,4)],6)
=> ([(2,5),(3,4)],6)
=> ? = 0 + 3
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> ([(4,5)],6)
=> ([(4,5)],6)
=> ? = 0 + 3
([(0,4),(3,5),(4,3),(5,1),(5,2)],6)
=> ([(4,5)],6)
=> ([(4,5)],6)
=> ? = 0 + 3
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> ([(4,5)],6)
=> ([(4,5)],6)
=> ? = 0 + 3
([(0,3),(1,4),(1,5),(2,4),(2,5),(3,1),(3,2)],6)
=> ([(2,5),(3,4)],6)
=> ([(2,5),(3,4)],6)
=> ? = 0 + 3
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([],6)
=> ([],6)
=> ? = 0 + 3
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> ([(4,5)],6)
=> ([(4,5)],6)
=> ? = 0 + 3
([(0,2),(0,3),(2,4),(2,5),(3,4),(3,5),(4,6),(5,6),(6,1)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ? = 0 + 3
([(0,1),(0,2),(1,5),(1,6),(2,5),(2,6),(5,3),(5,4),(6,3),(6,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ? = 1 + 3
([(0,6),(1,6),(2,5),(3,5),(4,2),(4,3),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ? = 0 + 3
([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ? = 0 + 3
([(0,6),(1,6),(4,5),(5,2),(5,3),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ? = 0 + 3
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> ([(5,6)],7)
=> ([(5,6)],7)
=> ? = 0 + 3
([(0,6),(1,6),(3,4),(4,2),(5,3),(6,5)],7)
=> ([(5,6)],7)
=> ([(5,6)],7)
=> ? = 0 + 3
([(0,6),(1,6),(2,5),(3,5),(5,4),(6,2),(6,3)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ? = 0 + 3
([(0,6),(1,6),(2,4),(2,5),(3,4),(3,5),(6,2),(6,3)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ? = 1 + 3
([(0,5),(0,6),(1,5),(1,6),(3,2),(4,2),(5,3),(5,4),(6,3),(6,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ? = 1 + 3
([(0,5),(0,6),(1,5),(1,6),(4,2),(4,3),(5,4),(6,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ? = 1 + 3
([(0,5),(0,6),(1,5),(1,6),(2,3),(4,2),(5,4),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ? = 0 + 3
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
=> ([(5,6)],7)
=> ([(5,6)],7)
=> ? = 0 + 3
([(0,3),(0,4),(3,6),(4,6),(5,1),(5,2),(6,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ? = 0 + 3
([(0,3),(1,4),(1,5),(2,4),(2,5),(3,1),(3,2),(4,6),(5,6)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ? = 0 + 3
([(0,5),(1,6),(2,6),(5,1),(5,2),(6,3),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ? = 0 + 3
([(0,3),(1,5),(1,6),(2,5),(2,6),(3,4),(4,1),(4,2)],7)
=> ([(3,6),(4,5)],7)
=> ([(3,6),(4,5)],7)
=> ? = 0 + 3
([(0,5),(3,4),(4,6),(5,3),(6,1),(6,2)],7)
=> ([(5,6)],7)
=> ([(5,6)],7)
=> ? = 0 + 3
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> ([],7)
=> ([],7)
=> ? = 0 + 3
([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
=> ([(5,6)],7)
=> ([(5,6)],7)
=> ? = 0 + 3
Description
The girth of a graph, which is not a tree. This is the length of the shortest cycle in the graph.
Mp00198: Posets incomparability graphGraphs
Mp00111: Graphs complementGraphs
Mp00275: Graphs to edge-partition of connected componentsInteger partitions
St000175: Integer partitions ⟶ ℤResult quality: 50% values known / values provided: 89%distinct values known / distinct values provided: 50%
Values
([(0,1)],2)
=> ([],2)
=> ([(0,1)],2)
=> [1]
=> 0
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> [2]
=> 0
([(0,2),(2,1)],3)
=> ([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 0
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> [2]
=> 0
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [3]
=> 0
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 0
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> 0
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> 0
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> 0
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [3]
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> 0
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 0
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [4]
=> 0
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 0
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> 0
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 0
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> 0
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [6]
=> 0
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 0
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> 0
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 0
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> 0
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [4]
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [6]
=> 0
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> 0
([(0,4),(1,3),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 0
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 0
([(0,3),(0,4),(1,3),(1,4),(4,2)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> 0
([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> 0
([(0,2),(0,4),(3,1),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 0
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [6]
=> 0
([(0,3),(0,4),(1,2),(2,3),(2,4)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> 0
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> 0
([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> 0
([(0,4),(3,2),(4,1),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> 0
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [10]
=> 0
([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [6]
=> 0
([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> 0
([(0,1),(0,2),(0,3),(0,4),(0,5)],6)
=> ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [5]
=> 0
([(0,2),(0,3),(0,4),(0,5),(5,1)],6)
=> ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [6]
=> 0
([(0,1),(0,2),(0,3),(0,4),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [7]
=> 0
([(0,1),(0,2),(0,3),(0,4),(2,5),(3,5),(4,5)],6)
=> ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [8]
=> 0
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [9]
=> 0
([(0,2),(0,3),(2,4),(2,5),(3,4),(3,5),(4,6),(5,6),(6,1)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,1),(0,2),(1,5),(1,6),(2,5),(2,6),(5,3),(5,4),(6,3),(6,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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)
=> [18]
=> ? = 1
([(0,4),(0,5),(1,6),(4,6),(5,1),(6,2),(6,3)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,6),(1,6),(2,6),(3,5),(5,4),(6,3)],7)
=> ([(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,4),(1,6),(2,6),(3,6),(4,5),(5,1),(5,2),(5,3)],7)
=> ([(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,6),(1,6),(4,3),(5,2),(5,4),(6,5)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,6),(1,6),(2,5),(3,5),(4,2),(4,3),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,6),(1,6),(4,5),(5,2),(5,3),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [20]
=> ? = 0
([(0,6),(1,6),(3,4),(4,2),(5,3),(6,5)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [20]
=> ? = 0
([(0,6),(1,6),(2,5),(3,5),(5,4),(6,2),(6,3)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,6),(1,6),(2,4),(2,5),(3,4),(3,5),(6,2),(6,3)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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)
=> [18]
=> ? = 1
([(0,5),(0,6),(1,5),(1,6),(3,2),(4,2),(5,3),(5,4),(6,3),(6,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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)
=> [18]
=> ? = 1
([(0,6),(1,6),(2,5),(3,5),(4,3),(6,2),(6,4)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,6),(1,2),(2,6),(3,5),(4,5),(6,3),(6,4)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,5),(0,6),(1,5),(1,6),(4,2),(4,3),(5,4),(6,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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)
=> [18]
=> ? = 1
([(0,5),(0,6),(1,5),(1,6),(2,3),(4,2),(5,4),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,5),(0,6),(1,5),(1,6),(3,4),(4,2),(5,3),(6,4)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,2),(0,3),(0,4),(2,6),(3,6),(4,6),(5,1),(6,5)],7)
=> ([(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(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)
=> [18]
=> ? = 0
([(0,3),(0,5),(1,6),(3,6),(4,1),(5,4),(6,2)],7)
=> ([(3,6),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [20]
=> ? = 0
([(0,3),(0,4),(3,6),(4,6),(5,1),(6,2),(6,5)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,2),(0,3),(1,5),(2,4),(2,6),(3,4),(3,6),(4,5),(6,1)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,2),(0,3),(1,4),(1,5),(2,4),(2,5),(3,1),(4,6),(5,6)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,3),(0,4),(3,6),(4,6),(5,1),(5,2),(6,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(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)
=> [18]
=> ? = 0
([(0,4),(2,5),(2,6),(3,5),(3,6),(4,2),(4,3),(6,1)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,3),(1,4),(1,5),(2,4),(2,5),(3,1),(3,2),(4,6),(5,6)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,5),(1,6),(2,6),(5,1),(5,2),(6,3),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,5),(1,6),(2,6),(3,6),(5,1),(5,2),(5,3),(6,4)],7)
=> ([(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,5),(4,6),(5,4),(6,1),(6,2),(6,3)],7)
=> ([(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,5),(1,6),(2,6),(4,2),(5,1),(5,4),(6,3)],7)
=> ([(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [19]
=> ? = 0
([(0,6),(1,3),(1,6),(3,5),(4,2),(5,4),(6,5)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(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)
=> [18]
=> ? = 0
([(0,3),(0,5),(2,6),(3,6),(4,1),(5,2),(6,4)],7)
=> ([(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [19]
=> ? = 0
([(0,3),(1,5),(1,6),(3,5),(3,6),(4,2),(5,4),(6,4)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,4),(1,5),(1,6),(2,5),(2,6),(3,2),(4,1),(4,3)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,3),(1,5),(1,6),(2,5),(2,6),(3,4),(4,1),(4,2)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,4),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(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)
=> [18]
=> ? = 0
([(0,6),(1,4),(4,6),(5,2),(5,3),(6,5)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,5),(3,4),(4,6),(5,3),(6,1),(6,2)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [20]
=> ? = 0
([(0,5),(3,4),(4,1),(5,6),(6,2),(6,3)],7)
=> ([(3,6),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,5),(3,6),(4,1),(5,3),(6,2),(6,4)],7)
=> ([(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [19]
=> ? = 0
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> ([],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [21]
=> ? = 0
([(0,6),(1,3),(3,6),(4,2),(5,4),(6,5)],7)
=> ([(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [19]
=> ? = 0
([(0,4),(1,6),(2,6),(3,2),(4,5),(5,1),(5,3)],7)
=> ([(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [19]
=> ? = 0
([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [20]
=> ? = 0
([(0,6),(1,4),(3,6),(4,3),(5,2),(6,5)],7)
=> ([(3,6),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [20]
=> ? = 0
Description
Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. Given a partition $\lambda$ with $r$ parts, the number of semi-standard Young-tableaux of shape $k\lambda$ and boxes with values in $[r]$ grows as a polynomial in $k$. This follows by setting $q=1$ in (7.105) on page 375 of [1], which yields the polynomial $$p(k) = \prod_{i < j}\frac{k(\lambda_j-\lambda_i)+j-i}{j-i}.$$ The statistic of the degree of this polynomial. For example, the partition $(3, 2, 1, 1, 1)$ gives $$p(k) = \frac{-1}{36} (k - 3) (2k - 3) (k - 2)^2 (k - 1)^3$$ which has degree 7 in $k$. Thus, $[3, 2, 1, 1, 1] \mapsto 7$. This is the same as the number of unordered pairs of different parts, which follows from: $$\deg p(k)=\sum_{i < j}\begin{cases}1& \lambda_j \neq \lambda_i\\0&\lambda_i=\lambda_j\end{cases}=\sum_{\stackrel{i < j}{\lambda_j \neq \lambda_i}} 1$$
Mp00198: Posets incomparability graphGraphs
Mp00111: Graphs complementGraphs
Mp00275: Graphs to edge-partition of connected componentsInteger partitions
St001175: Integer partitions ⟶ ℤResult quality: 50% values known / values provided: 89%distinct values known / distinct values provided: 50%
Values
([(0,1)],2)
=> ([],2)
=> ([(0,1)],2)
=> [1]
=> 0
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> [2]
=> 0
([(0,2),(2,1)],3)
=> ([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 0
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> [2]
=> 0
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [3]
=> 0
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 0
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> 0
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> 0
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> 0
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [3]
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> 0
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 0
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [4]
=> 0
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 0
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> 0
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 0
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> 0
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [6]
=> 0
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 0
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> 0
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 0
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> 0
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [4]
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [6]
=> 0
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> 0
([(0,4),(1,3),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 0
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 0
([(0,3),(0,4),(1,3),(1,4),(4,2)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> 0
([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> 0
([(0,2),(0,4),(3,1),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 0
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [6]
=> 0
([(0,3),(0,4),(1,2),(2,3),(2,4)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> 0
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> 0
([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> 0
([(0,4),(3,2),(4,1),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> 0
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [10]
=> 0
([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [6]
=> 0
([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> 0
([(0,1),(0,2),(0,3),(0,4),(0,5)],6)
=> ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [5]
=> 0
([(0,2),(0,3),(0,4),(0,5),(5,1)],6)
=> ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [6]
=> 0
([(0,1),(0,2),(0,3),(0,4),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [7]
=> 0
([(0,1),(0,2),(0,3),(0,4),(2,5),(3,5),(4,5)],6)
=> ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [8]
=> 0
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [9]
=> 0
([(0,2),(0,3),(2,4),(2,5),(3,4),(3,5),(4,6),(5,6),(6,1)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,1),(0,2),(1,5),(1,6),(2,5),(2,6),(5,3),(5,4),(6,3),(6,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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)
=> [18]
=> ? = 1
([(0,4),(0,5),(1,6),(4,6),(5,1),(6,2),(6,3)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,6),(1,6),(2,6),(3,5),(5,4),(6,3)],7)
=> ([(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,4),(1,6),(2,6),(3,6),(4,5),(5,1),(5,2),(5,3)],7)
=> ([(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,6),(1,6),(4,3),(5,2),(5,4),(6,5)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,6),(1,6),(2,5),(3,5),(4,2),(4,3),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,6),(1,6),(4,5),(5,2),(5,3),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [20]
=> ? = 0
([(0,6),(1,6),(3,4),(4,2),(5,3),(6,5)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [20]
=> ? = 0
([(0,6),(1,6),(2,5),(3,5),(5,4),(6,2),(6,3)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,6),(1,6),(2,4),(2,5),(3,4),(3,5),(6,2),(6,3)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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)
=> [18]
=> ? = 1
([(0,5),(0,6),(1,5),(1,6),(3,2),(4,2),(5,3),(5,4),(6,3),(6,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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)
=> [18]
=> ? = 1
([(0,6),(1,6),(2,5),(3,5),(4,3),(6,2),(6,4)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,6),(1,2),(2,6),(3,5),(4,5),(6,3),(6,4)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,5),(0,6),(1,5),(1,6),(4,2),(4,3),(5,4),(6,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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)
=> [18]
=> ? = 1
([(0,5),(0,6),(1,5),(1,6),(2,3),(4,2),(5,4),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,5),(0,6),(1,5),(1,6),(3,4),(4,2),(5,3),(6,4)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,2),(0,3),(0,4),(2,6),(3,6),(4,6),(5,1),(6,5)],7)
=> ([(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(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)
=> [18]
=> ? = 0
([(0,3),(0,5),(1,6),(3,6),(4,1),(5,4),(6,2)],7)
=> ([(3,6),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [20]
=> ? = 0
([(0,3),(0,4),(3,6),(4,6),(5,1),(6,2),(6,5)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,2),(0,3),(1,5),(2,4),(2,6),(3,4),(3,6),(4,5),(6,1)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,2),(0,3),(1,4),(1,5),(2,4),(2,5),(3,1),(4,6),(5,6)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,3),(0,4),(3,6),(4,6),(5,1),(5,2),(6,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(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)
=> [18]
=> ? = 0
([(0,4),(2,5),(2,6),(3,5),(3,6),(4,2),(4,3),(6,1)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,3),(1,4),(1,5),(2,4),(2,5),(3,1),(3,2),(4,6),(5,6)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,5),(1,6),(2,6),(5,1),(5,2),(6,3),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,5),(1,6),(2,6),(3,6),(5,1),(5,2),(5,3),(6,4)],7)
=> ([(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,5),(4,6),(5,4),(6,1),(6,2),(6,3)],7)
=> ([(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,5),(1,6),(2,6),(4,2),(5,1),(5,4),(6,3)],7)
=> ([(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [19]
=> ? = 0
([(0,6),(1,3),(1,6),(3,5),(4,2),(5,4),(6,5)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(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)
=> [18]
=> ? = 0
([(0,3),(0,5),(2,6),(3,6),(4,1),(5,2),(6,4)],7)
=> ([(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [19]
=> ? = 0
([(0,3),(1,5),(1,6),(3,5),(3,6),(4,2),(5,4),(6,4)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,4),(1,5),(1,6),(2,5),(2,6),(3,2),(4,1),(4,3)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,3),(1,5),(1,6),(2,5),(2,6),(3,4),(4,1),(4,2)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,4),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(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)
=> [18]
=> ? = 0
([(0,6),(1,4),(4,6),(5,2),(5,3),(6,5)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,5),(3,4),(4,6),(5,3),(6,1),(6,2)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [20]
=> ? = 0
([(0,5),(3,4),(4,1),(5,6),(6,2),(6,3)],7)
=> ([(3,6),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,5),(3,6),(4,1),(5,3),(6,2),(6,4)],7)
=> ([(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [19]
=> ? = 0
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> ([],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [21]
=> ? = 0
([(0,6),(1,3),(3,6),(4,2),(5,4),(6,5)],7)
=> ([(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [19]
=> ? = 0
([(0,4),(1,6),(2,6),(3,2),(4,5),(5,1),(5,3)],7)
=> ([(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [19]
=> ? = 0
([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [20]
=> ? = 0
([(0,6),(1,4),(3,6),(4,3),(5,2),(6,5)],7)
=> ([(3,6),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [20]
=> ? = 0
Description
The size of a partition minus the hook length of the base cell. This is, the number of boxes in the diagram of a partition that are neither in the first row nor in the first column.
Mp00198: Posets incomparability graphGraphs
Mp00111: Graphs complementGraphs
Mp00275: Graphs to edge-partition of connected componentsInteger partitions
St001176: Integer partitions ⟶ ℤResult quality: 50% values known / values provided: 89%distinct values known / distinct values provided: 50%
Values
([(0,1)],2)
=> ([],2)
=> ([(0,1)],2)
=> [1]
=> 0
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> [2]
=> 0
([(0,2),(2,1)],3)
=> ([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 0
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> [2]
=> 0
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [3]
=> 0
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 0
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> 0
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> 0
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> 0
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [3]
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> 0
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 0
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [4]
=> 0
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 0
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> 0
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 0
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> 0
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [6]
=> 0
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 0
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> 0
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 0
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> 0
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [4]
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [6]
=> 0
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> 0
([(0,4),(1,3),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 0
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 0
([(0,3),(0,4),(1,3),(1,4),(4,2)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> 0
([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> 0
([(0,2),(0,4),(3,1),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 0
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [6]
=> 0
([(0,3),(0,4),(1,2),(2,3),(2,4)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> 0
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> 0
([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> 0
([(0,4),(3,2),(4,1),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> 0
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [10]
=> 0
([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [6]
=> 0
([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> 0
([(0,1),(0,2),(0,3),(0,4),(0,5)],6)
=> ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [5]
=> 0
([(0,2),(0,3),(0,4),(0,5),(5,1)],6)
=> ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [6]
=> 0
([(0,1),(0,2),(0,3),(0,4),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [7]
=> 0
([(0,1),(0,2),(0,3),(0,4),(2,5),(3,5),(4,5)],6)
=> ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [8]
=> 0
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [9]
=> 0
([(0,2),(0,3),(2,4),(2,5),(3,4),(3,5),(4,6),(5,6),(6,1)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,1),(0,2),(1,5),(1,6),(2,5),(2,6),(5,3),(5,4),(6,3),(6,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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)
=> [18]
=> ? = 1
([(0,4),(0,5),(1,6),(4,6),(5,1),(6,2),(6,3)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,6),(1,6),(2,6),(3,5),(5,4),(6,3)],7)
=> ([(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,4),(1,6),(2,6),(3,6),(4,5),(5,1),(5,2),(5,3)],7)
=> ([(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,6),(1,6),(4,3),(5,2),(5,4),(6,5)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,6),(1,6),(2,5),(3,5),(4,2),(4,3),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,6),(1,6),(4,5),(5,2),(5,3),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [20]
=> ? = 0
([(0,6),(1,6),(3,4),(4,2),(5,3),(6,5)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [20]
=> ? = 0
([(0,6),(1,6),(2,5),(3,5),(5,4),(6,2),(6,3)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,6),(1,6),(2,4),(2,5),(3,4),(3,5),(6,2),(6,3)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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)
=> [18]
=> ? = 1
([(0,5),(0,6),(1,5),(1,6),(3,2),(4,2),(5,3),(5,4),(6,3),(6,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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)
=> [18]
=> ? = 1
([(0,6),(1,6),(2,5),(3,5),(4,3),(6,2),(6,4)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,6),(1,2),(2,6),(3,5),(4,5),(6,3),(6,4)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,5),(0,6),(1,5),(1,6),(4,2),(4,3),(5,4),(6,4)],7)
=> ([(1,6),(2,5),(3,4)],7)
=> ([(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)
=> [18]
=> ? = 1
([(0,5),(0,6),(1,5),(1,6),(2,3),(4,2),(5,4),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,5),(0,6),(1,5),(1,6),(3,4),(4,2),(5,3),(6,4)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,2),(0,3),(0,4),(2,6),(3,6),(4,6),(5,1),(6,5)],7)
=> ([(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(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)
=> [18]
=> ? = 0
([(0,3),(0,5),(1,6),(3,6),(4,1),(5,4),(6,2)],7)
=> ([(3,6),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [20]
=> ? = 0
([(0,3),(0,4),(3,6),(4,6),(5,1),(6,2),(6,5)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,2),(0,3),(1,5),(2,4),(2,6),(3,4),(3,6),(4,5),(6,1)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,2),(0,3),(1,4),(1,5),(2,4),(2,5),(3,1),(4,6),(5,6)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,3),(0,4),(3,6),(4,6),(5,1),(5,2),(6,5)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(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)
=> [18]
=> ? = 0
([(0,4),(2,5),(2,6),(3,5),(3,6),(4,2),(4,3),(6,1)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,3),(1,4),(1,5),(2,4),(2,5),(3,1),(3,2),(4,6),(5,6)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,5),(1,6),(2,6),(5,1),(5,2),(6,3),(6,4)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,5),(1,6),(2,6),(3,6),(5,1),(5,2),(5,3),(6,4)],7)
=> ([(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,5),(4,6),(5,4),(6,1),(6,2),(6,3)],7)
=> ([(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,5),(1,6),(2,6),(4,2),(5,1),(5,4),(6,3)],7)
=> ([(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [19]
=> ? = 0
([(0,6),(1,3),(1,6),(3,5),(4,2),(5,4),(6,5)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(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)
=> [18]
=> ? = 0
([(0,3),(0,5),(2,6),(3,6),(4,1),(5,2),(6,4)],7)
=> ([(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [19]
=> ? = 0
([(0,3),(1,5),(1,6),(3,5),(3,6),(4,2),(5,4),(6,4)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,4),(1,5),(1,6),(2,5),(2,6),(3,2),(4,1),(4,3)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,3),(1,5),(1,6),(2,5),(2,6),(3,4),(4,1),(4,2)],7)
=> ([(3,6),(4,5)],7)
=> ([(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,5),(4,6),(5,6)],7)
=> [19]
=> ? = 0
([(0,4),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(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)
=> [18]
=> ? = 0
([(0,6),(1,4),(4,6),(5,2),(5,3),(6,5)],7)
=> ([(2,3),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [18]
=> ? = 0
([(0,5),(3,4),(4,6),(5,3),(6,1),(6,2)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [20]
=> ? = 0
([(0,5),(3,4),(4,1),(5,6),(6,2),(6,3)],7)
=> ([(3,6),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,5),(3,6),(4,1),(5,3),(6,2),(6,4)],7)
=> ([(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [19]
=> ? = 0
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> ([],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [21]
=> ? = 0
([(0,6),(1,3),(3,6),(4,2),(5,4),(6,5)],7)
=> ([(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [19]
=> ? = 0
([(0,4),(1,6),(2,6),(3,2),(4,5),(5,1),(5,3)],7)
=> ([(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [19]
=> ? = 0
([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [20]
=> ? = 0
([(0,6),(1,4),(3,6),(4,3),(5,2),(6,5)],7)
=> ([(3,6),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [18]
=> ? = 0
([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
=> ([(5,6)],7)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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)
=> [20]
=> ? = 0
Description
The size of a partition minus its first part. This is the number of boxes in its diagram that are not in the first row.
The following 701 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. St001586The number of odd parts smaller than the largest even part in an integer partition. St001657The number of twos in an integer partition. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001961The sum of the greatest common divisors of all pairs of parts. St000010The length of the partition. St001593This is the number of standard Young tableaux of the given shifted shape. 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. St001933The largest multiplicity of a part in an integer partition. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001967The coefficient of the monomial corresponding to the integer partition in a certain power series. St001968The coefficient of the monomial corresponding to the integer partition in a certain power series. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a 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. St000447The number of pairs of vertices of a graph with distance 3. St000449The number of pairs of vertices of a graph with distance 4. St000552The number of cut vertices of a graph. St001793The difference between the clique number and the chromatic number of a graph. St000553The number of blocks of a graph. St000775The multiplicity of the largest eigenvalue in a graph. St000785The number of distinct colouring schemes of a graph. St000916The packing number of a graph. St001739The number of graphs with the same edge polytope as the given graph. St001740The number of graphs with the same symmetric edge polytope as the given graph. St001776The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph. St001307The number of induced stars on four vertices in a graph. St000287The number of connected components of a graph. St001282The number of graphs with the same chromatic polynomial. St001496The number of graphs with the same Laplacian spectrum as the given graph. St001518The number of graphs with the same ordinary spectrum as the given graph. St001256Number of simple reflexive modules that are 2-stable reflexive. St001387Number of standard Young tableaux of the skew shape tracing the border of the given partition. St001780The order of promotion on the set of standard tableaux of given shape. St001479The number of bridges of a graph. St001570The minimal number of edges to add to make a graph Hamiltonian. St000048The multinomial of the parts of a partition. St000097The order of the largest clique of the graph. St000260The radius of a connected graph. St000259The diameter of a connected graph. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St001578The minimal number of edges to add or remove to make a graph a line graph. St000286The number of connected components of the complement of a graph. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. 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. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St000759The smallest missing part in an integer partition. St001845The number of join irreducibles minus the rank of a lattice. St001310The number of induced diamond graphs in a graph. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001490The number of connected components of a skew partition. St001309The number of four-cliques in a graph. St000657The smallest part of an integer composition. St000383The last part of an integer composition. St000312The number of leaves in a graph. St001335The cardinality of a minimal cycle-isolating set of a graph. St001322The size of a minimal independent dominating set in a graph. St001339The irredundance number of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001363The Euler characteristic of a graph according to Knill. 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. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001645The pebbling number of a connected graph. St000093The cardinality of a maximal independent set of vertices of a graph. St000455The second largest eigenvalue of a graph if it is integral. St000481The number of upper covers of a partition in dominance order. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. St001091The number of parts in an integer partition whose next smaller part has the same size. St000003The number of standard Young tableaux of the partition. St000159The number of distinct parts of the integer partition. St000160The multiplicity of the smallest part of a partition. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000346The number of coarsenings of a partition. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000548The number of different non-empty partial sums of an integer partition. St000618The number of self-evacuating tableaux of given shape. St000810The sum of the entries in the column specified by the partition of the change of basis matrix from powersum symmetric functions to monomial symmetric functions. St000814The sum of the entries in the column specified by the partition of the change of basis matrix from elementary symmetric functions to Schur symmetric functions. St000897The number of different multiplicities of parts of an integer partition. St001121The multiplicity of the irreducible representation indexed by the partition in the Kronecker square corresponding to the partition. St001432The order dimension of the partition. St000511The number of invariant subsets when acting with a permutation of given cycle type. 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. St000284The Plancherel distribution on integer partitions. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. 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. St000993The multiplicity of the largest part of an integer partition. St001128The exponens consonantiae of a partition. St001890The maximum magnitude of the Möbius function of a poset. St001964The interval resolution global dimension of a poset. St000475The number of parts equal to 1 in a partition. St000069The number of maximal elements of a poset. St000068The number of minimal elements in a poset. St001305The number of induced cycles on four vertices in a graph. St001306The number of induced paths on four vertices in a graph. St001324The minimal number of occurrences of the chordal-pattern in a linear ordering of the vertices of the graph. St001326The minimal number of occurrences of the interval-pattern in a linear ordering of the vertices of the graph. St001327The minimal number of occurrences of the split-pattern in a linear ordering of the vertices of the graph. St001353The number of prime nodes in the modular decomposition of a graph. St001356The number of vertices in prime modules of a graph. St001272The number of graphs with the same degree sequence. St001393The induced matching number of a graph. St001261The Castelnuovo-Mumford regularity of a graph. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000752The Grundy value for the game 'Couples are forever' on an integer partition. St000480The number of lower covers of a partition in dominance order. St000913The number of ways to refine the partition into singletons. St000474Dyson's crank of a partition. St000667The greatest common divisor of the parts of the partition. St000668The least common multiple of the parts of the partition. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000770The major index of an integer partition when read from bottom to top. St000995The largest even part of an integer partition. St000997The even-odd crank of an integer partition. St000322The skewness of a graph. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St001055The Grundy value for the game of removing cells of a row in an integer partition. St000212The number of standard Young tableaux for an integer partition such that no two consecutive entries appear in the same row. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000379The number of Hamiltonian cycles in a graph. St000456The monochromatic index of a connected graph. St001592The maximal number of simple paths between any two different vertices of a graph. St000143The largest repeated part of a partition. St000185The weighted size of a partition. St000225Difference between largest and smallest parts in a partition. St001214The aft of an integer partition. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St000049The number of set partitions whose sorted block sizes correspond to the partition. St000275Number of permutations whose sorted list of non zero multiplicities of the Lehmer code is the given partition. St000781The number of proper colouring schemes of a Ferrers diagram. St000783The side length of the largest staircase partition fitting into a partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St000318The number of addable cells of the Ferrers diagram of an integer partition. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001568The smallest positive integer that does not appear twice in the partition. St000315The number of isolated vertices of a graph. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000741The Colin de Verdière graph invariant. St001651The Frankl number of a lattice. St000355The number of occurrences of the pattern 21-3. St000406The number of occurrences of the pattern 3241 in a permutation. St000407The number of occurrences of the pattern 2143 in a permutation. St000425The number of occurrences of the pattern 132 or of the pattern 213 in a permutation. St000486The number of cycles of length at least 3 of a permutation. St000516The number of stretching pairs of a permutation. St000623The number of occurrences of the pattern 52341 in a permutation. St000646The number of big ascents of a permutation. St000650The number of 3-rises of a permutation. St000663The number of right floats of a permutation. St000664The number of right ropes of a permutation. St000666The number of right tethers of a permutation. St000709The number of occurrences of 14-2-3 or 14-3-2. St000732The number of double deficiencies of a permutation. St000750The number of occurrences of the pattern 4213 in a permutation. St000751The number of occurrences of either of the pattern 2143 or 2143 in a permutation. St000799The number of occurrences of the vincular pattern |213 in a permutation. St000803The number of occurrences of the vincular pattern |132 in a permutation. St001550The number of inversions between exceedances where the greater exceedance is linked. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St001715The number of non-records in a permutation. St001766The number of cells which are not occupied by the same tile in all reduced pipe dreams corresponding to a permutation. St001847The number of occurrences of the pattern 1432 in a permutation. St000078The number of alternating sign matrices whose left key is the permutation. St000652The maximal difference between successive positions of a permutation. St001162The minimum jump of a permutation. St001344The neighbouring number of a permutation. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001735The number of permutations with the same set of runs. St000095The number of triangles of a graph. St000096The number of spanning trees of a graph. St000276The size of the preimage of the map 'to graph' from Ordered trees to Graphs. St001573The minimal number of edges to remove to make a graph triangle-free. St000283The size of the preimage of the map 'to graph' from Binary trees to Graphs. St000323The minimal crossing number of a graph. St000351The determinant of the adjacency matrix of a graph. St000368The Altshuler-Steinberg determinant of a graph. St000370The genus of a graph. St000403The Szeged index minus the Wiener index of a graph. St000448The number of pairs of vertices of a graph with distance 2. St000671The maximin edge-connectivity for choosing a subgraph. St000699The toughness times the least common multiple of 1,. St000948The chromatic discriminant of a graph. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. St001069The coefficient of the monomial xy of the Tutte polynomial of the graph. St001119The length of a shortest maximal path in a graph. St001281The normalized isoperimetric number of a graph. St001308The number of induced paths on three vertices in a graph. St001323The independence gap of a graph. St001329The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph. St001334The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001347The number of pairs of vertices of a graph having the same neighbourhood. St001350Half of the Albertson index of a graph. St001351The Albertson index of a graph. St001357The maximal degree of a regular spanning subgraph of a graph. St001374The Padmakar-Ivan index of a graph. St001395The number of strictly unfriendly partitions of a graph. St001521Half the total irregularity of a graph. St001522The total irregularity of a graph. St001574The minimal number of edges to add or remove to make a graph regular. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001576The minimal number of edges to add or remove to make a graph vertex transitive. St001577The minimal number of edges to add or remove to make a graph a cograph. St001646The number of edges that can be added without increasing the maximal degree of a graph. St001647The number of edges that can be added without increasing the clique number. St001648The number of edges that can be added without increasing the chromatic number. St001689The number of celebrities in a graph. St001690The length of a longest path in a graph such that after removing the paths edges, every vertex of the path has distance two from some other vertex of the path. St001691The number of kings in a graph. St001692The number of vertices with higher degree than the average degree in a graph. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001703The villainy of a graph. St001708The number of pairs of vertices of different degree in a graph. St001742The difference of the maximal and the minimal degree in a graph. St001764The number of non-convex subsets of vertices in a graph. St001794Half the number of sets of vertices in a graph which are dominating and non-blocking. St001795The binary logarithm of the evaluation of the Tutte polynomial of the graph at (x,y) equal to (-1,-1). St001796The absolute value of the quotient of the Tutte polynomial of the graph at (1,1) and (-1,-1). St001798The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph. St001799The number of proper separations of a graph. St001826The maximal number of leaves on a vertex of a graph. St001871The number of triconnected components of a graph. St001957The number of Hasse diagrams with a given underlying undirected graph. St000273The domination number of a graph. St000349The number of different adjacency matrices of a graph. St000388The number of orbits of vertices of a graph under automorphisms. St000544The cop number of a graph. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000917The open packing number of a graph. St001056The Grundy value for the game of deleting vertices of a graph until it has no edges. St001057The Grundy value of the game of creating an independent set in a graph. St001070The absolute value of the derivative of the chromatic polynomial of the graph at 1. St001071The beta invariant of the graph. St001316The domatic number of a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001349The number of different graphs obtained from the given graph by removing an edge. St001352The number of internal nodes in the modular decomposition of a graph. St001354The number of series nodes in the modular decomposition of a graph. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001463The number of distinct columns in the nullspace of a graph. St001642The Prague dimension of a graph. St001672The restrained domination number of a graph. St001734The lettericity of a graph. St001765The number of connected components of the friends and strangers graph. St001774The degree of the minimal polynomial of the smallest eigenvalue of a graph. St001775The degree of the minimal polynomial of the largest eigenvalue of a graph. St001829The common independence number of a graph. St001917The order of toric promotion on the set of labellings of a graph. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St000258The burning number of a graph. St000918The 2-limited packing number of a graph. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001330The hat guessing number of a graph. St001654The monophonic hull number of a graph. St001656The monophonic position number of a graph. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St000081The number of edges of a graph. St000089The absolute variation of a composition. St000090The variation of a composition. St000091The descent variation of a composition. St000150The floored half-sum of the multiplicities of a partition. St000171The degree of the graph. St000257The number of distinct parts of a partition that occur at least twice. St000263The Szeged index of a graph. St000265The Wiener index of a graph. St000272The treewidth of a graph. St000274The number of perfect matchings of a graph. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by $4$. St000310The minimal degree of a vertex of a graph. St000311The number of vertices of odd degree in a graph. St000313The number of degree 2 vertices of a graph. St000317The cycle descent number of a permutation. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000350The sum of the vertex degrees of a graph. St000361The second Zagreb index of a graph. St000362The size of a minimal vertex cover of a graph. St000376The bounce deficit of a Dyck path. St000387The matching number of a graph. St000422The energy of a graph, if it is integral. St000454The largest eigenvalue of a graph if it is integral. St000465The first Zagreb index of a graph. St000535The rank-width of a graph. St000536The pathwidth of a graph. St000537The cutwidth of a graph. St000571The F-index (or forgotten topological index) of a graph. St000637The length of the longest cycle in a graph. St000687The dimension of $Hom(I,P)$ for the LNakayama algebra of a Dyck path. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000761The number of ascents in an integer composition. St000766The number of inversions of an integer composition. St000768The number of peaks in an integer composition. St000769The major index of a composition regarded as a word. St000790The number of pairs of centered tunnels, one strictly containing the other, of a Dyck path. St000807The sum of the heights of the valleys of the associated bargraph. St000915The Ore degree of a graph. St000932The number of occurrences of the pattern UDU in a Dyck path. St000951The dimension of $Ext^{1}(D(A),A)$ of the corresponding LNakayama algebra. St000966Number of peaks minus the global dimension of the corresponding LNakayama algebra. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001010Number of indecomposable injective modules with projective dimension g-1 when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001021Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the Dyck path. St001022Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path. St001025Number of simple modules with projective dimension 4 in the Nakayama algebra corresponding to the Dyck path. St001037The number of inner corners of the upper path of the parallelogram polyomino associated with the Dyck path. St001059Number of occurrences of the patterns 41352,42351,51342,52341 in a permutation. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001117The game chromatic index of a graph. St001120The length of a longest path in a graph. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001167The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra. St001172The number of 1-rises at odd height of a Dyck path. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001193The dimension of $Ext_A^1(A/AeA,A)$ in the corresponding Nakayama algebra $A$ such that $eA$ is a minimal faithful projective-injective module. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001234The number of indecomposable three dimensional modules with projective dimension one. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001263The index of the maximal parabolic seaweed algebra associated with the composition. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St001270The bandwidth of a graph. St001271The competition number of a graph. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001277The degeneracy of a graph. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001301The first Betti number of the order complex associated with the poset. St001311The cyclomatic number of a graph. St001317The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the graph. St001319The minimal number of occurrences of the star-pattern in a linear ordering of the vertices of the graph. St001320The minimal number of occurrences of the path-pattern in a linear ordering of the vertices of the graph. St001328The minimal number of occurrences of the bipartite-pattern in a linear ordering of the vertices of the graph. St001331The size of the minimal feedback vertex set. St001341The number of edges in the center of a graph. St001358The largest degree of a regular subgraph of a graph. St001362The normalized Knill dimension of a graph. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001458The rank of the adjacency matrix of a graph. St001459The number of zero columns in the nullspace of a graph. St001480The number of simple summands of the module J^2/J^3. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001512The minimum rank of a graph. St001525The number of symmetric hooks on the diagonal of a partition. St001561The value of the elementary symmetric function evaluated at 1. St001572The minimal number of edges to remove to make a graph bipartite. St001584The area statistic between a Dyck path and its bounce path. St001588The number of distinct odd parts smaller than the largest even part in an integer partition. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001638The book thickness of a graph. St001644The dimension of a graph. St001649The length of a longest trail in a graph. St001673The degree of asymmetry of an integer composition. St001705The number of occurrences of the pattern 2413 in a permutation. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001736The total number of cycles in a graph. St001743The discrepancy of a graph. St001783The number of odd automorphisms of a graph. St001792The arboricity of a graph. St001797The number of overfull subgraphs of a graph. St001812The biclique partition number of a graph. St001869The maximum cut size of a graph. St001873For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between $e_i J$ and $e_j J$ (the radical of the indecomposable projective modules). St001910The height of the middle non-run of a Dyck path. St001932The number of pairs of singleton blocks in the noncrossing set partition corresponding to a Dyck path, that can be merged to create another noncrossing set partition. St001939The number of parts that are equal to their multiplicity in the integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St001962The proper pathwidth of a graph. St000047The number of standard immaculate tableaux of a given shape. St000053The number of valleys of the Dyck path. St000079The number of alternating sign matrices for a given Dyck path. St000086The number of subgraphs. St000098The chromatic number of a graph. St000146The Andrews-Garvan crank of a partition. St000172The Grundy number of a graph. St000183The side length of the Durfee square of an integer partition. St000256The number of parts from which one can substract 2 and still get an integer partition. St000266The number of spanning subgraphs of a graph with the same connected components. St000267The number of maximal spanning forests contained in a graph. St000268The number of strongly connected orientations of a graph. St000269The number of acyclic orientations of a graph. St000270The number of forests contained in a graph. St000277The number of ribbon shaped standard tableaux. St000299The number of nonisomorphic vertex-induced subtrees. St000335The difference of lower and upper interactions. St000343The number of spanning subgraphs of a graph. St000344The number of strongly connected outdegree sequences of a graph. St000363The number of minimal vertex covers of a graph. St000381The largest part of an integer composition. St000382The first part of an integer composition. St000443The number of long tunnels of a Dyck path. St000452The number of distinct eigenvalues of a graph. St000453The number of distinct Laplacian eigenvalues of a graph. St000468The Hosoya index of a graph. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000517The Kreweras number of an integer partition. St000570The Edelman-Greene number of a permutation. St000659The number of rises of length at least 2 of a Dyck path. St000674The number of hills of a Dyck path. St000675The number of centered multitunnels of a Dyck path. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000722The number of different neighbourhoods in a graph. St000758The length of the longest staircase fitting into an integer composition. St000760The length of the longest strictly decreasing subsequence of parts of an integer composition. St000763The sum of the positions of the strong records of an integer composition. St000764The number of strong records in an integer composition. St000767The number of runs in an integer composition. St000805The number of peaks of the associated bargraph. St000808The number of up steps of the associated bargraph. St000816The number of standard composition tableaux of the composition. St000820The number of compositions obtained by rotating the composition. St000822The Hadwiger number of the graph. St000903The number of different parts of an integer composition. St000905The number of different multiplicities of parts of an integer composition. St000908The length of the shortest maximal antichain in a poset. St000914The sum of the values of the Möbius function of a poset. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St000964Gives the dimension of Ext^g(D(A),A) of the corresponding LNakayama algebra, when g denotes the global dimension of that algebra. St000965The sum of the dimension of Ext^i(D(A),A) for i=1,. St000968We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n−1}]$ by adding $c_0$ to $c_{n−1}$. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St000972The composition number of a graph. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001014Number of indecomposable injective modules with codominant dimension equal to the dominant dimension of the Nakayama algebra corresponding to the Dyck path. St001026The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path. St001029The size of the core of a graph. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001063Numbers of 3-torsionfree simple modules in the corresponding Nakayama algebra. St001064Number of simple modules in the corresponding Nakayama algebra that are 3-syzygy modules. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001072The evaluation of the Tutte polynomial of the graph at x and y equal to 3. St001073The number of nowhere zero 3-flows of a graph. St001093The detour number of a graph. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001108The 2-dynamic chromatic number of a graph. St001109The number of proper colourings of a graph with as few colours as possible. St001110The 3-dynamic chromatic number of a graph. St001111The weak 2-dynamic chromatic number of a graph. St001112The 3-weak dynamic number of a graph. St001116The game chromatic number of a graph. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001159Number of simple modules with dominant dimension equal to the global dimension in the corresponding Nakayama algebra. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001191Number of simple modules $S$ with $Ext_A^i(S,A)=0$ for all $i=0,1,...,g-1$ in the corresponding Nakayama algebra $A$ with global dimension $g$. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001196The global dimension of $A$ minus the global dimension of $eAe$ for the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001251The number of parts of a partition that are not congruent 1 modulo 3. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001276The number of 2-regular indecomposable modules in the corresponding Nakayama algebra. St001280The number of parts of an integer partition that are at least two. St001289The vector space dimension of the n-fold tensor product of D(A), where n is maximal such that this n-fold tensor product is nonzero. St001302The number of minimally dominating sets of vertices of a graph. St001303The number of dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001386The number of prime labellings of a graph. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001474The evaluation of the Tutte polynomial of the graph at (x,y) equal to (2,-1). St001475The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,0). St001476The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,-1). St001477The number of nowhere zero 5-flows of a graph. St001478The number of nowhere zero 4-flows of a graph. St001481The minimal height of a peak of a Dyck path. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001484The number of singletons of an integer partition. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001494The Alon-Tarsi number of a graph. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001502The global dimension minus the dominant dimension of magnitude 1 Nakayama algebras. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001523The degree of symmetry of a Dyck path. St001531Number of partial orders contained in the poset determined by the Dyck path. St001546The number of monomials in the Tutte polynomial of a graph. St001580The acyclic chromatic number of a graph. St001581The achromatic number of a graph. St001591The number of graphs with the given composition of multiplicities of Laplacian eigenvalues. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St001670The connected partition number of a graph. St001674The number of vertices of the largest induced star graph in the graph. St001694The number of maximal dissociation sets in a graph. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St001716The 1-improper chromatic number of a graph. St001722The number of minimal chains with small intervals between a binary word and the top element. St001725The harmonious chromatic number of a graph. St001732The number of peaks visible from the left. St001733The number of weak left to right maxima of a Dyck path. St001883The mutual visibility number of a graph. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001959The product of the heights of the peaks of a Dyck path. St001963The tree-depth of a graph. St000340The number of non-final maximal constant sub-paths of length greater than one. St000378The diagonal inversion number of an integer partition. St000482The (zero)-forcing number of a graph. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St000678The number of up steps after the last double rise of a Dyck path. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000765The number of weak records in an integer composition. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000778The metric dimension of a graph. St000899The maximal number of repetitions of an integer composition. St000904The maximal number of repetitions of an integer composition. St000969We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n-1}]$ by adding $c_0$ to $c_{n-1}$. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001203We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n-1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a Dyck path as follows: St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001286The annihilation number of a graph. St001315The dissociation number of a graph. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St001471The magnitude of a Dyck path. St001500The global dimension of magnitude 1 Nakayama algebras. St001669The number of single rises in a Dyck path. St001949The rigidity index of a graph. St000469The distinguishing number of a graph. St000636The hull number of a graph. St000762The sum of the positions of the weak records of an integer composition. St000981The length of the longest zigzag subpath. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001166Number of indecomposable projective non-injective modules with dominant dimension equal to the global dimension plus the number of indecomposable projective injective modules in the corresponding Nakayama algebra. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St001655The general position number of a graph. St001342The number of vertices in the center of a graph. St001368The number of vertices of maximal degree in a graph. St000660The number of rises of length at least 3 of a Dyck path. St000817The sum of the entries in the column specified by the composition of the change of basis matrix from dual immaculate quasisymmetric functions to monomial quasisymmetric functions. St000818The sum of the entries in the column specified by the composition of the change of basis matrix from quasisymmetric Schur functions to monomial quasisymmetric functions. St001060The distinguishing index of a graph. St001545The second Elser number of a connected graph. St001834The number of non-isomorphic minors of a graph. St000655The length of the minimal rise of a Dyck path. St001626The number of maximal proper sublattices of a lattice. St001095The number of non-isomorphic posets with precisely one further covering relation. St001396Number of triples of incomparable elements in a finite poset. St000181The number of connected components of the Hasse diagram for the poset. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001533The largest coefficient of the Poincare polynomial of the poset cone. 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. St001877Number of indecomposable injective modules with projective dimension 2. 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. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St000057The Shynar inversion number of a standard tableau. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St001385The number of conjugacy classes of subgroups with connected subgroups of sizes prescribed by an integer partition. St001487The number of inner corners of a skew partition. St001571The Cartan determinant of the integer partition. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St001139The number of occurrences of hills of size 2 in a Dyck path. St001141The number of occurrences of hills of size 3 in a Dyck path. St000658The number of rises of length 2 of a Dyck path. St001498The normalised height of a Nakayama algebra with magnitude 1. St001371The length of the longest Yamanouchi prefix of a binary word. St001730The number of times the path corresponding to a binary word crosses the base line. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001208The number of connected components of the quiver of $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra $A$ of $K[x]/(x^n)$. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001677The number of non-degenerate subsets of a lattice whose meet is the bottom element. St001681The number of inclusion-wise minimal subsets of a lattice, whose meet is the bottom element. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices. St001613The binary logarithm of the size of the center of a lattice. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001827The number of two-component spanning forests of a graph. St000117The number of centered tunnels of a Dyck path. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001811The Castelnuovo-Mumford regularity of a permutation. St000331The number of upper interactions of a Dyck path. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001274The number of indecomposable injective modules with projective dimension equal to two. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St000006The dinv of a Dyck path. St000015The number of peaks of a Dyck path. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000950Number of tilting modules of the corresponding LNakayama algebra, where a tilting module is a generalised tilting module of projective dimension 1. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001275The projective dimension of the second term in a minimal injective coresolution of the regular module. St001299The product of all non-zero projective dimensions of simple modules of the corresponding Nakayama algebra. St001488The number of corners of a skew partition. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001530The depth of a Dyck path. St001182Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001473The absolute value of the sum of all entries of the Coxeter matrix of the corresponding LNakayama algebra. St001872The number of indecomposable injective modules with even projective dimension in the corresponding Nakayama algebra. St001966Half the global dimension of the stable Auslander algebra of a sincere Nakayama algebra (with associated Dyck path). St001695The natural comajor index of a standard Young tableau. St001698The comajor index of a standard tableau minus the weighted size of its shape. St001699The major index of a standard tableau minus the weighted size of its shape. St001712The number of natural descents of a standard Young tableau. St001462The number of factors of a standard tableaux under concatenation. St001625The Möbius invariant of a lattice. St001621The number of atoms of a lattice. St001624The breadth of a lattice.