searching the database
Your data matches 196 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St001440
Mp00013: Binary trees —to poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St001440: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St001440: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[.,.],[.,.]]
=> ([(0,2),(1,2)],3)
=> [2,1]
=> [1]
=> 0
[.,[[.,.],[.,.]]]
=> ([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> [1]
=> 0
[[.,.],[.,[.,.]]]
=> ([(0,3),(1,2),(2,3)],4)
=> [3,1]
=> [1]
=> 0
[[.,.],[[.,.],.]]
=> ([(0,3),(1,2),(2,3)],4)
=> [3,1]
=> [1]
=> 0
[[.,[.,.]],[.,.]]
=> ([(0,3),(1,2),(2,3)],4)
=> [3,1]
=> [1]
=> 0
[[[.,.],.],[.,.]]
=> ([(0,3),(1,2),(2,3)],4)
=> [3,1]
=> [1]
=> 0
[[[.,.],[.,.]],.]
=> ([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> [1]
=> 0
[.,[.,[[.,.],[.,.]]]]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> [4,1]
=> [1]
=> 0
[.,[[.,.],[.,[.,.]]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> [4,1]
=> [1]
=> 0
[.,[[.,.],[[.,.],.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> [4,1]
=> [1]
=> 0
[.,[[.,[.,.]],[.,.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> [4,1]
=> [1]
=> 0
[.,[[[.,.],.],[.,.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> [4,1]
=> [1]
=> 0
[.,[[[.,.],[.,.]],.]]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> [4,1]
=> [1]
=> 0
[[.,.],[.,[.,[.,.]]]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> [4,1]
=> [1]
=> 0
[[.,.],[.,[[.,.],.]]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> [4,1]
=> [1]
=> 0
[[.,.],[[.,.],[.,.]]]
=> ([(0,4),(1,3),(2,3),(3,4)],5)
=> [3,1,1]
=> [1,1]
=> 1
[[.,.],[[.,[.,.]],.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> [4,1]
=> [1]
=> 0
[[.,.],[[[.,.],.],.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> [4,1]
=> [1]
=> 0
[[.,[.,.]],[.,[.,.]]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> [3,2]
=> [2]
=> 0
[[.,[.,.]],[[.,.],.]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> [3,2]
=> [2]
=> 0
[[[.,.],.],[.,[.,.]]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> [3,2]
=> [2]
=> 0
[[[.,.],.],[[.,.],.]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> [3,2]
=> [2]
=> 0
[[.,[.,[.,.]]],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> [4,1]
=> [1]
=> 0
[[.,[[.,.],.]],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> [4,1]
=> [1]
=> 0
[[[.,.],[.,.]],[.,.]]
=> ([(0,4),(1,3),(2,3),(3,4)],5)
=> [3,1,1]
=> [1,1]
=> 1
[[[.,[.,.]],.],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> [4,1]
=> [1]
=> 0
[[[[.,.],.],.],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> [4,1]
=> [1]
=> 0
[[.,[[.,.],[.,.]]],.]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> [4,1]
=> [1]
=> 0
[[[.,.],[.,[.,.]]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> [4,1]
=> [1]
=> 0
[[[.,.],[[.,.],.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> [4,1]
=> [1]
=> 0
[[[.,[.,.]],[.,.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> [4,1]
=> [1]
=> 0
[[[[.,.],.],[.,.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> [4,1]
=> [1]
=> 0
[[[[.,.],[.,.]],.],.]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> [4,1]
=> [1]
=> 0
[.,[.,[.,[[.,.],[.,.]]]]]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [5,1]
=> [1]
=> 0
[.,[.,[[.,.],[.,[.,.]]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> [5,1]
=> [1]
=> 0
[.,[.,[[.,.],[[.,.],.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> [5,1]
=> [1]
=> 0
[.,[.,[[.,[.,.]],[.,.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> [5,1]
=> [1]
=> 0
[.,[.,[[[.,.],.],[.,.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> [5,1]
=> [1]
=> 0
[.,[.,[[[.,.],[.,.]],.]]]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [5,1]
=> [1]
=> 0
[.,[[.,.],[.,[.,[.,.]]]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> [5,1]
=> [1]
=> 0
[.,[[.,.],[.,[[.,.],.]]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> [5,1]
=> [1]
=> 0
[.,[[.,.],[[.,.],[.,.]]]]
=> ([(0,5),(1,4),(2,4),(4,5),(5,3)],6)
=> [4,1,1]
=> [1,1]
=> 1
[.,[[.,.],[[.,[.,.]],.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> [5,1]
=> [1]
=> 0
[.,[[.,.],[[[.,.],.],.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> [5,1]
=> [1]
=> 0
[.,[[.,[.,.]],[.,[.,.]]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> [4,2]
=> [2]
=> 0
[.,[[.,[.,.]],[[.,.],.]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> [4,2]
=> [2]
=> 0
[.,[[[.,.],.],[.,[.,.]]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> [4,2]
=> [2]
=> 0
[.,[[[.,.],.],[[.,.],.]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> [4,2]
=> [2]
=> 0
[.,[[.,[.,[.,.]]],[.,.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> [5,1]
=> [1]
=> 0
[.,[[.,[[.,.],.]],[.,.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> [5,1]
=> [1]
=> 0
Description
The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition.
Matching statistic: St000095
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
[[.,.],[.,.]]
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,.]]]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> 0
[[.,.],[.,[.,.]]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[.,.],[[.,.],.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[.,[.,.]],[.,.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[[.,.],.],[.,.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[[.,.],[.,.]],.]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,.],[.,.]]]]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,[.,.]]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[[.,.],.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,.]],[.,.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],.],[.,.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],[.,.]],.]]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,.],[.,[.,[.,.]]]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,.],[.,[[.,.],.]]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(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)
=> 1
[[.,.],[[.,[.,.]],.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,.],[[[.,.],.],.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[.,.]],[.,[.,.]]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[.,.]],[[.,.],.]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],.],[.,[.,.]]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],.],[[.,.],.]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[.,[.,.]]],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[[.,.],.]],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(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)
=> 1
[[[.,[.,.]],.],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[[.,.],.],.],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[[.,.],[.,.]]],.]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],[.,[.,.]]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],[[.,.],.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,[.,.]],[.,.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[[.,.],.],[.,.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[[.,.],[.,.]],.],.]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[.,[.,[[.,.],[.,.]]]]]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,.],[.,[.,.]]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,.],[[.,.],.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,[.,.]],[.,.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[[.,.],.],[.,.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[[.,.],[.,.]],.]]]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,[.,[.,.]]]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,[[.,.],.]]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[[.,.],[.,.]]]]
=> ([(0,5),(1,4),(2,4),(4,5),(5,3)],6)
=> ([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[.,[[.,.],[[.,[.,.]],.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[[[.,.],.],.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,.]],[.,[.,.]]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,.]],[[.,.],.]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],.],[.,[.,.]]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],.],[[.,.],.]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,[.,.]]],[.,.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[[.,.],.]],[.,.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[[.,.],[[.,.],[[.,.],[.,.]]]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[.,.],[[[.,.],[.,.]],[.,.]]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[[.,.],[.,.]],[[.,.],[.,.]]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,6),(5,6)],7)
=> ([(1,2),(1,5),(1,6),(2,3),(2,4),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,2),(1,5),(1,6),(2,3),(2,4),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1
[[[.,.],[[.,.],[.,.]]],[.,.]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[[[.,.],[.,.]],[.,.]],[.,.]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[[[.,.],[.,.]],[.,.]],[[.,.],[.,.]]]
=> ([(0,7),(1,5),(2,5),(3,6),(4,6),(5,8),(6,7),(7,8)],9)
=> ([(1,5),(1,7),(1,8),(2,5),(2,6),(2,7),(2,8),(3,4),(3,5),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(6,7),(6,8),(7,8)],9)
=> ?
=> ? = 1
Description
The number of triangles of a graph.
A triangle $T$ of a graph $G$ is a collection of three vertices $\{u,v,w\} \in G$ such that they form $K_3$, the complete graph on three vertices.
Matching statistic: St000450
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
[[.,.],[.,.]]
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,.]]]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> 0
[[.,.],[.,[.,.]]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[.,.],[[.,.],.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[.,[.,.]],[.,.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[[.,.],.],[.,.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[[.,.],[.,.]],.]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,.],[.,.]]]]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,[.,.]]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[[.,.],.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,.]],[.,.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],.],[.,.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],[.,.]],.]]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,.],[.,[.,[.,.]]]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,.],[.,[[.,.],.]]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(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)
=> 1
[[.,.],[[.,[.,.]],.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,.],[[[.,.],.],.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[.,.]],[.,[.,.]]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[.,.]],[[.,.],.]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],.],[.,[.,.]]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],.],[[.,.],.]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[.,[.,.]]],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[[.,.],.]],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(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)
=> 1
[[[.,[.,.]],.],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[[.,.],.],.],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[[.,.],[.,.]]],.]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],[.,[.,.]]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],[[.,.],.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,[.,.]],[.,.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[[.,.],.],[.,.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[[.,.],[.,.]],.],.]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[.,[.,[[.,.],[.,.]]]]]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,.],[.,[.,.]]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,.],[[.,.],.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,[.,.]],[.,.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[[.,.],.],[.,.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[[.,.],[.,.]],.]]]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,[.,[.,.]]]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,[[.,.],.]]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[[.,.],[.,.]]]]
=> ([(0,5),(1,4),(2,4),(4,5),(5,3)],6)
=> ([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[.,[[.,.],[[.,[.,.]],.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[[[.,.],.],.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,.]],[.,[.,.]]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,.]],[[.,.],.]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],.],[.,[.,.]]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],.],[[.,.],.]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,[.,.]]],[.,.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[[.,.],.]],[.,.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[[.,.],[[.,.],[[.,.],[.,.]]]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[.,.],[[[.,.],[.,.]],[.,.]]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[[.,.],[.,.]],[[.,.],[.,.]]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,6),(5,6)],7)
=> ([(1,2),(1,5),(1,6),(2,3),(2,4),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,2),(1,5),(1,6),(2,3),(2,4),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1
[[[.,.],[[.,.],[.,.]]],[.,.]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[[[.,.],[.,.]],[.,.]],[.,.]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[[[.,.],[.,.]],[.,.]],[[.,.],[.,.]]]
=> ([(0,7),(1,5),(2,5),(3,6),(4,6),(5,8),(6,7),(7,8)],9)
=> ([(1,5),(1,7),(1,8),(2,5),(2,6),(2,7),(2,8),(3,4),(3,5),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(6,7),(6,8),(7,8)],9)
=> ?
=> ? = 1
Description
The number of edges minus the number of vertices plus 2 of a graph.
When G is connected and planar, this is also the number of its faces.
When $G=(V,E)$ is a connected graph, this is its $k$-monochromatic index for $k>2$: for $2\leq k\leq |V|$, the $k$-monochromatic index of $G$ is the maximum number of edge colors allowed such that for each set $S$ of $k$ vertices, there exists a monochromatic tree in $G$ which contains all vertices from $S$. It is shown in [1] that for $k>2$, this is given by this statistic.
Matching statistic: St001572
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Values
[[.,.],[.,.]]
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,.]]]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> 0
[[.,.],[.,[.,.]]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[.,.],[[.,.],.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[.,[.,.]],[.,.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[[.,.],.],[.,.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[[.,.],[.,.]],.]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,.],[.,.]]]]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,[.,.]]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[[.,.],.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,.]],[.,.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],.],[.,.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],[.,.]],.]]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,.],[.,[.,[.,.]]]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,.],[.,[[.,.],.]]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(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)
=> 1
[[.,.],[[.,[.,.]],.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,.],[[[.,.],.],.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[.,.]],[.,[.,.]]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[.,.]],[[.,.],.]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],.],[.,[.,.]]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],.],[[.,.],.]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[.,[.,.]]],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[[.,.],.]],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(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)
=> 1
[[[.,[.,.]],.],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[[.,.],.],.],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[[.,.],[.,.]]],.]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],[.,[.,.]]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],[[.,.],.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,[.,.]],[.,.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[[.,.],.],[.,.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[[.,.],[.,.]],.],.]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[.,[.,[[.,.],[.,.]]]]]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,.],[.,[.,.]]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,.],[[.,.],.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,[.,.]],[.,.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[[.,.],.],[.,.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[[.,.],[.,.]],.]]]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,[.,[.,.]]]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,[[.,.],.]]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[[.,.],[.,.]]]]
=> ([(0,5),(1,4),(2,4),(4,5),(5,3)],6)
=> ([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[.,[[.,.],[[.,[.,.]],.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[[[.,.],.],.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,.]],[.,[.,.]]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,.]],[[.,.],.]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],.],[.,[.,.]]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],.],[[.,.],.]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,[.,.]]],[.,.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[[.,.],.]],[.,.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[[.,.],[[.,.],[[.,.],[.,.]]]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[.,.],[[[.,.],[.,.]],[.,.]]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[[.,.],[.,.]],[[.,.],[.,.]]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,6),(5,6)],7)
=> ([(1,2),(1,5),(1,6),(2,3),(2,4),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,2),(1,5),(1,6),(2,3),(2,4),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1
[[[.,.],[[.,.],[.,.]]],[.,.]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[[[.,.],[.,.]],[.,.]],[.,.]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[[[.,.],[.,.]],[.,.]],[[.,.],[.,.]]]
=> ([(0,7),(1,5),(2,5),(3,6),(4,6),(5,8),(6,7),(7,8)],9)
=> ([(1,5),(1,7),(1,8),(2,5),(2,6),(2,7),(2,8),(3,4),(3,5),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(6,7),(6,8),(7,8)],9)
=> ?
=> ? = 1
Description
The minimal number of edges to remove to make a graph bipartite.
Matching statistic: St001573
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Values
[[.,.],[.,.]]
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,.]]]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> 0
[[.,.],[.,[.,.]]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[.,.],[[.,.],.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[.,[.,.]],[.,.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[[.,.],.],[.,.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[[.,.],[.,.]],.]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,.],[.,.]]]]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,[.,.]]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[[.,.],.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,.]],[.,.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],.],[.,.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],[.,.]],.]]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,.],[.,[.,[.,.]]]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,.],[.,[[.,.],.]]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(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)
=> 1
[[.,.],[[.,[.,.]],.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,.],[[[.,.],.],.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[.,.]],[.,[.,.]]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[.,.]],[[.,.],.]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],.],[.,[.,.]]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],.],[[.,.],.]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[.,[.,.]]],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[[.,.],.]],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(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)
=> 1
[[[.,[.,.]],.],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[[.,.],.],.],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[[.,.],[.,.]]],.]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],[.,[.,.]]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],[[.,.],.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,[.,.]],[.,.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[[.,.],.],[.,.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[[.,.],[.,.]],.],.]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[.,[.,[[.,.],[.,.]]]]]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,.],[.,[.,.]]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,.],[[.,.],.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,[.,.]],[.,.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[[.,.],.],[.,.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[[.,.],[.,.]],.]]]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,[.,[.,.]]]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,[[.,.],.]]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[[.,.],[.,.]]]]
=> ([(0,5),(1,4),(2,4),(4,5),(5,3)],6)
=> ([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[.,[[.,.],[[.,[.,.]],.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[[[.,.],.],.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,.]],[.,[.,.]]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,.]],[[.,.],.]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],.],[.,[.,.]]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],.],[[.,.],.]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,[.,.]]],[.,.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[[.,.],.]],[.,.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[[.,.],[[.,.],[[.,.],[.,.]]]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[.,.],[[[.,.],[.,.]],[.,.]]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[[.,.],[.,.]],[[.,.],[.,.]]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,6),(5,6)],7)
=> ([(1,2),(1,5),(1,6),(2,3),(2,4),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,2),(1,5),(1,6),(2,3),(2,4),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1
[[[.,.],[[.,.],[.,.]]],[.,.]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[[[.,.],[.,.]],[.,.]],[.,.]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[[[.,.],[.,.]],[.,.]],[[.,.],[.,.]]]
=> ([(0,7),(1,5),(2,5),(3,6),(4,6),(5,8),(6,7),(7,8)],9)
=> ([(1,5),(1,7),(1,8),(2,5),(2,6),(2,7),(2,8),(3,4),(3,5),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(6,7),(6,8),(7,8)],9)
=> ?
=> ? = 1
Description
The minimal number of edges to remove to make a graph triangle-free.
Matching statistic: St001575
Values
[[.,.],[.,.]]
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,.]]]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> 0
[[.,.],[.,[.,.]]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[.,.],[[.,.],.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[.,[.,.]],[.,.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[[.,.],.],[.,.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[[.,.],[.,.]],.]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,.],[.,.]]]]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,[.,.]]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[[.,.],.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,.]],[.,.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],.],[.,.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],[.,.]],.]]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,.],[.,[.,[.,.]]]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,.],[.,[[.,.],.]]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(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)
=> 1
[[.,.],[[.,[.,.]],.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,.],[[[.,.],.],.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[.,.]],[.,[.,.]]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[.,.]],[[.,.],.]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],.],[.,[.,.]]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],.],[[.,.],.]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[.,[.,.]]],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[[.,.],.]],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(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)
=> 1
[[[.,[.,.]],.],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[[.,.],.],.],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[[.,.],[.,.]]],.]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],[.,[.,.]]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],[[.,.],.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,[.,.]],[.,.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[[.,.],.],[.,.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[[.,.],[.,.]],.],.]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[.,[.,[[.,.],[.,.]]]]]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,.],[.,[.,.]]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,.],[[.,.],.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,[.,.]],[.,.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[[.,.],.],[.,.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[[.,.],[.,.]],.]]]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,[.,[.,.]]]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,[[.,.],.]]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[[.,.],[.,.]]]]
=> ([(0,5),(1,4),(2,4),(4,5),(5,3)],6)
=> ([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[.,[[.,.],[[.,[.,.]],.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[[[.,.],.],.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,.]],[.,[.,.]]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,.]],[[.,.],.]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],.],[.,[.,.]]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],.],[[.,.],.]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,[.,.]]],[.,.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[[.,.],.]],[.,.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[[.,.],[[.,.],[[.,.],[.,.]]]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[.,.],[[[.,.],[.,.]],[.,.]]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[[.,.],[.,.]],[[.,.],[.,.]]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,6),(5,6)],7)
=> ([(1,2),(1,5),(1,6),(2,3),(2,4),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,2),(1,5),(1,6),(2,3),(2,4),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1
[[[.,.],[[.,.],[.,.]]],[.,.]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[[[.,.],[.,.]],[.,.]],[.,.]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[[[.,.],[.,.]],[.,.]],[[.,.],[.,.]]]
=> ([(0,7),(1,5),(2,5),(3,6),(4,6),(5,8),(6,7),(7,8)],9)
=> ([(1,5),(1,7),(1,8),(2,5),(2,6),(2,7),(2,8),(3,4),(3,5),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(6,7),(6,8),(7,8)],9)
=> ?
=> ? = 1
Description
The minimal number of edges to add or remove to make a graph edge transitive.
A graph is edge transitive, if for any two edges, there is an automorphism that maps one edge to the other.
Matching statistic: St001638
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Values
[[.,.],[.,.]]
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,.]]]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> 0
[[.,.],[.,[.,.]]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[.,.],[[.,.],.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[.,[.,.]],[.,.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[[.,.],.],[.,.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
[[[.,.],[.,.]],.]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,.],[.,.]]]]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,[.,.]]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[[.,.],.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,.]],[.,.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],.],[.,.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],[.,.]],.]]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,.],[.,[.,[.,.]]]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,.],[.,[[.,.],.]]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(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)
=> 1
[[.,.],[[.,[.,.]],.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,.],[[[.,.],.],.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[.,.]],[.,[.,.]]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[.,.]],[[.,.],.]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],.],[.,[.,.]]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],.],[[.,.],.]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[.,[.,.]]],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[[.,.],.]],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(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)
=> 1
[[[.,[.,.]],.],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[[.,.],.],.],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[.,[[.,.],[.,.]]],.]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],[.,[.,.]]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,.],[[.,.],.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[.,[.,.]],[.,.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[[.,.],.],[.,.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
[[[[.,.],[.,.]],.],.]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
[.,[.,[.,[[.,.],[.,.]]]]]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,.],[.,[.,.]]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,.],[[.,.],.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[.,[.,.]],[.,.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[[.,.],.],[.,.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[.,[[[.,.],[.,.]],.]]]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,[.,[.,.]]]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[.,[[.,.],.]]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[[.,.],[.,.]]]]
=> ([(0,5),(1,4),(2,4),(4,5),(5,3)],6)
=> ([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[.,[[.,.],[[.,[.,.]],.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,.],[[[.,.],.],.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,.]],[.,[.,.]]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,.]],[[.,.],.]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],.],[.,[.,.]]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[[.,.],.],[[.,.],.]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[.,[.,.]]],[.,.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[.,[[.,[[.,.],.]],[.,.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 0
[[.,.],[[.,.],[[.,.],[.,.]]]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[.,.],[[[.,.],[.,.]],[.,.]]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[[.,.],[.,.]],[[.,.],[.,.]]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,6),(5,6)],7)
=> ([(1,2),(1,5),(1,6),(2,3),(2,4),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,2),(1,5),(1,6),(2,3),(2,4),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1
[[[.,.],[[.,.],[.,.]]],[.,.]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[[[.,.],[.,.]],[.,.]],[.,.]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[[[[.,.],[.,.]],[.,.]],[[.,.],[.,.]]]
=> ([(0,7),(1,5),(2,5),(3,6),(4,6),(5,8),(6,7),(7,8)],9)
=> ([(1,5),(1,7),(1,8),(2,5),(2,6),(2,7),(2,8),(3,4),(3,5),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(6,7),(6,8),(7,8)],9)
=> ?
=> ? = 1
Description
The book thickness of a graph.
The book thickness (or pagenumber, or stacknumber) of a graph is the minimal number of pages required for a book embedding of a graph.
Matching statistic: St001644
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
[[.,.],[.,.]]
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,.],[.,.]]]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,.],[.,[.,.]]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,.],[[.,.],.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,[.,.]],[.,.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[[.,.],.],[.,.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[[.,.],[.,.]],.]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[.,[[.,.],[.,.]]]]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,.],[.,[.,.]]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,.],[[.,.],.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,[.,.]],[.,.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[[.,.],.],[.,.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[[.,.],[.,.]],.]]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,.],[.,[.,[.,.]]]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,.],[.,[[.,.],.]]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,.],[[.,.],[.,.]]]
=> ([(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)
=> 2 = 1 + 1
[[.,.],[[.,[.,.]],.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,.],[[[.,.],.],.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,[.,.]],[.,[.,.]]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,[.,.]],[[.,.],.]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[[.,.],.],[.,[.,.]]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[[.,.],.],[[.,.],.]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,[.,[.,.]]],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,[[.,.],.]],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[[.,.],[.,.]],[.,.]]
=> ([(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)
=> 2 = 1 + 1
[[[.,[.,.]],.],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[[[.,.],.],.],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,[[.,.],[.,.]]],.]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[[.,.],[.,[.,.]]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[[.,.],[[.,.],.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[[.,[.,.]],[.,.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[[[.,.],.],[.,.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[[[.,.],[.,.]],.],.]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[.,[.,[[.,.],[.,.]]]]]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[.,[[.,.],[.,[.,.]]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[.,[[.,.],[[.,.],.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[.,[[.,[.,.]],[.,.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[.,[[[.,.],.],[.,.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[.,[[[.,.],[.,.]],.]]]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,.],[.,[.,[.,.]]]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,.],[.,[[.,.],.]]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,.],[[.,.],[.,.]]]]
=> ([(0,5),(1,4),(2,4),(4,5),(5,3)],6)
=> ([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[.,[[.,.],[[.,[.,.]],.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,.],[[[.,.],.],.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,[.,.]],[.,[.,.]]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,[.,.]],[[.,.],.]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[[.,.],.],[.,[.,.]]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[[.,.],.],[[.,.],.]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,[.,[.,.]]],[.,.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,[[.,.],.]],[.,.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,.],[[.,.],[[.,.],[.,.]]]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0 + 1
[[.,.],[[[.,.],[.,.]],[.,.]]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0 + 1
[[[.,.],[.,.]],[[.,.],[.,.]]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,6),(5,6)],7)
=> ([(1,2),(1,5),(1,6),(2,3),(2,4),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,2),(1,5),(1,6),(2,3),(2,4),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 + 1
[[[.,.],[[.,.],[.,.]]],[.,.]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0 + 1
[[[[.,.],[.,.]],[.,.]],[.,.]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0 + 1
[[[[.,.],[.,.]],[.,.]],[[.,.],[.,.]]]
=> ([(0,7),(1,5),(2,5),(3,6),(4,6),(5,8),(6,7),(7,8)],9)
=> ([(1,5),(1,7),(1,8),(2,5),(2,6),(2,7),(2,8),(3,4),(3,5),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(6,7),(6,8),(7,8)],9)
=> ?
=> ? = 1 + 1
Description
The dimension of a graph.
The dimension of a graph is the least integer $n$ such that there exists a representation of the graph in the Euclidean space of dimension $n$ with all vertices distinct and all edges having unit length. Edges are allowed to intersect, however.
Matching statistic: St001812
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Values
[[.,.],[.,.]]
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,.],[.,.]]]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,.],[.,[.,.]]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,.],[[.,.],.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,[.,.]],[.,.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[[.,.],.],[.,.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[[.,.],[.,.]],.]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[.,[[.,.],[.,.]]]]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,.],[.,[.,.]]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,.],[[.,.],.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,[.,.]],[.,.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[[.,.],.],[.,.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[[.,.],[.,.]],.]]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,.],[.,[.,[.,.]]]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,.],[.,[[.,.],.]]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,.],[[.,.],[.,.]]]
=> ([(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)
=> 2 = 1 + 1
[[.,.],[[.,[.,.]],.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,.],[[[.,.],.],.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,[.,.]],[.,[.,.]]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,[.,.]],[[.,.],.]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[[.,.],.],[.,[.,.]]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[[.,.],.],[[.,.],.]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,[.,[.,.]]],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,[[.,.],.]],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[[.,.],[.,.]],[.,.]]
=> ([(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)
=> 2 = 1 + 1
[[[.,[.,.]],.],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[[[.,.],.],.],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,[[.,.],[.,.]]],.]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[[.,.],[.,[.,.]]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[[.,.],[[.,.],.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[[.,[.,.]],[.,.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[[[.,.],.],[.,.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[[[.,.],[.,.]],.],.]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[.,[.,[[.,.],[.,.]]]]]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[.,[[.,.],[.,[.,.]]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[.,[[.,.],[[.,.],.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[.,[[.,[.,.]],[.,.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[.,[[[.,.],.],[.,.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[.,[[[.,.],[.,.]],.]]]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,.],[.,[.,[.,.]]]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,.],[.,[[.,.],.]]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,.],[[.,.],[.,.]]]]
=> ([(0,5),(1,4),(2,4),(4,5),(5,3)],6)
=> ([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[.,[[.,.],[[.,[.,.]],.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,.],[[[.,.],.],.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,[.,.]],[.,[.,.]]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,[.,.]],[[.,.],.]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[[.,.],.],[.,[.,.]]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[[.,.],.],[[.,.],.]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,[.,[.,.]]],[.,.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[.,[[.,[[.,.],.]],[.,.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 1 = 0 + 1
[[.,.],[[.,.],[[.,.],[.,.]]]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0 + 1
[[.,.],[[[.,.],[.,.]],[.,.]]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0 + 1
[[[.,.],[.,.]],[[.,.],[.,.]]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,6),(5,6)],7)
=> ([(1,2),(1,5),(1,6),(2,3),(2,4),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,2),(1,5),(1,6),(2,3),(2,4),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 + 1
[[[.,.],[[.,.],[.,.]]],[.,.]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0 + 1
[[[[.,.],[.,.]],[.,.]],[.,.]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0 + 1
[[[[.,.],[.,.]],[.,.]],[[.,.],[.,.]]]
=> ([(0,7),(1,5),(2,5),(3,6),(4,6),(5,8),(6,7),(7,8)],9)
=> ([(1,5),(1,7),(1,8),(2,5),(2,6),(2,7),(2,8),(3,4),(3,5),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(6,7),(6,8),(7,8)],9)
=> ?
=> ? = 1 + 1
Description
The biclique partition number of a graph.
The biclique partition number of a graph is the minimum number of pairwise edge disjoint complete bipartite subgraphs so that each edge belongs to exactly one of them. A theorem of Graham and Pollak [1] asserts that the complete graph $K_n$ has biclique partition number $n - 1$.
Matching statistic: St000299
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
[[.,.],[.,.]]
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> 2 = 0 + 2
[.,[[.,.],[.,.]]]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[.,.],[.,[.,.]]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[.,.],[[.,.],.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[.,[.,.]],[.,.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[[.,.],.],[.,.]]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[[.,.],[.,.]],.]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> 2 = 0 + 2
[.,[.,[[.,.],[.,.]]]]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[.,[[.,.],[.,[.,.]]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[.,[[.,.],[[.,.],.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[.,[[.,[.,.]],[.,.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[.,[[[.,.],.],[.,.]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[.,[[[.,.],[.,.]],.]]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[.,.],[.,[.,[.,.]]]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[.,.],[.,[[.,.],.]]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[.,.],[[.,.],[.,.]]]
=> ([(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)
=> 3 = 1 + 2
[[.,.],[[.,[.,.]],.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[.,.],[[[.,.],.],.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[.,[.,.]],[.,[.,.]]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[.,[.,.]],[[.,.],.]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[[.,.],.],[.,[.,.]]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[[.,.],.],[[.,.],.]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[.,[.,[.,.]]],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[.,[[.,.],.]],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[[.,.],[.,.]],[.,.]]
=> ([(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)
=> 3 = 1 + 2
[[[.,[.,.]],.],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[[[.,.],.],.],[.,.]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[.,[[.,.],[.,.]]],.]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[[.,.],[.,[.,.]]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[[.,.],[[.,.],.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[[.,[.,.]],[.,.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[[[.,.],.],[.,.]],.]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[[[.,.],[.,.]],.],.]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 2 = 0 + 2
[.,[.,[.,[[.,.],[.,.]]]]]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> ([(1,2)],3)
=> 2 = 0 + 2
[.,[.,[[.,.],[.,[.,.]]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 2 = 0 + 2
[.,[.,[[.,.],[[.,.],.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 2 = 0 + 2
[.,[.,[[.,[.,.]],[.,.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 2 = 0 + 2
[.,[.,[[[.,.],.],[.,.]]]]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 2 = 0 + 2
[.,[.,[[[.,.],[.,.]],.]]]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> ([(1,2)],3)
=> 2 = 0 + 2
[.,[[.,.],[.,[.,[.,.]]]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 2 = 0 + 2
[.,[[.,.],[.,[[.,.],.]]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 2 = 0 + 2
[.,[[.,.],[[.,.],[.,.]]]]
=> ([(0,5),(1,4),(2,4),(4,5),(5,3)],6)
=> ([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 1 + 2
[.,[[.,.],[[.,[.,.]],.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 2 = 0 + 2
[.,[[.,.],[[[.,.],.],.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 2 = 0 + 2
[.,[[.,[.,.]],[.,[.,.]]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 2 = 0 + 2
[.,[[.,[.,.]],[[.,.],.]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 2 = 0 + 2
[.,[[[.,.],.],[.,[.,.]]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 2 = 0 + 2
[.,[[[.,.],.],[[.,.],.]]]
=> ([(0,4),(1,3),(3,5),(4,5),(5,2)],6)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> ([(1,2)],3)
=> 2 = 0 + 2
[.,[[.,[.,[.,.]]],[.,.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 2 = 0 + 2
[.,[[.,[[.,.],.]],[.,.]]]
=> ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> ([(2,5),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> 2 = 0 + 2
[[.,.],[[.,.],[[.,.],[.,.]]]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0 + 2
[[.,.],[[[.,.],[.,.]],[.,.]]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0 + 2
[[[.,.],[.,.]],[[.,.],[.,.]]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,6),(5,6)],7)
=> ([(1,2),(1,5),(1,6),(2,3),(2,4),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,2),(1,5),(1,6),(2,3),(2,4),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 + 2
[[[.,.],[[.,.],[.,.]]],[.,.]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0 + 2
[[[[.,.],[.,.]],[.,.]],[.,.]]
=> ([(0,4),(1,4),(2,5),(3,6),(4,6),(6,5)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0 + 2
[[[[.,.],[.,.]],[.,.]],[[.,.],[.,.]]]
=> ([(0,7),(1,5),(2,5),(3,6),(4,6),(5,8),(6,7),(7,8)],9)
=> ([(1,5),(1,7),(1,8),(2,5),(2,6),(2,7),(2,8),(3,4),(3,5),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(6,7),(6,8),(7,8)],9)
=> ?
=> ? = 1 + 2
Description
The number of nonisomorphic vertex-induced subtrees.
The following 186 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000553The number of blocks of a graph. St000822The Hadwiger number of the graph. St001391The disjunction number of a graph. St001642The Prague dimension of a graph. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001581The achromatic number of a graph. St000647The number of big descents of a permutation. St000455The second largest eigenvalue of a graph if it is integral. St000454The largest eigenvalue of a graph if it is integral. St000422The energy of a graph, if it is integral. St001330The hat guessing number of a graph. St000353The number of inner valleys of a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St000779The tier of a permutation. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000742The number of big ascents of a permutation after prepending zero. St000711The number of big exceedences of a permutation. St001728The number of invisible descents of a permutation. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St000354The number of recoils of a permutation. St000386The number of factors DDU in a Dyck path. St000256The number of parts from which one can substract 2 and still get an integer partition. St000710The number of big deficiencies of a permutation. St000741The Colin de Verdière graph invariant. St001060The distinguishing index of a graph. St000251The number of nonsingleton blocks of a set partition. St000523The number of 2-protected nodes of a rooted tree. St000023The number of inner peaks of a permutation. St000646The number of big ascents of a permutation. St000092The number of outer peaks of a permutation. St000099The number of valleys of a permutation, including the boundary. St000409The number of pitchforks in a binary tree. St000659The number of rises of length at least 2 of a Dyck path. St001621The number of atoms of a lattice. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by $4$. St000344The number of strongly connected outdegree sequences of a graph. St000379The number of Hamiltonian cycles in a graph. 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. St001335The cardinality of a minimal cycle-isolating set of a graph. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001736The total number of cycles in a graph. St001797The number of overfull subgraphs of a graph. St000171The degree of the graph. St000196The number of occurrences of the contiguous pattern [[.,.],[.,. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000272The treewidth of a graph. St000310The minimal degree of a vertex of a graph. St000360The number of occurrences of the pattern 32-1. St000362The size of a minimal vertex cover of a graph. St000482The (zero)-forcing number of a graph. St000536The pathwidth of a graph. St000537The cutwidth of a 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. 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. St000948The chromatic discriminant of a graph. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001037The number of inner corners of the upper path of the parallelogram polyomino associated with the Dyck path. St001119The length of a shortest maximal path in a graph. St001120The length of a longest path in a graph. St001270The bandwidth of a graph. St001277The degeneracy of a graph. St001281The normalized isoperimetric number of a graph. St001345The Hamming dimension of a graph. St001357The maximal degree of a regular spanning subgraph of a graph. St001358The largest degree of a regular subgraph of a graph. St001475The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,0). St001592The maximal number of simple paths between any two different vertices of a graph. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001716The 1-improper chromatic number of a graph. St001743The discrepancy of a graph. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001792The arboricity of a graph. St001869The maximum cut size of a graph. St001949The rigidity index of a graph. St001962The proper pathwidth of a graph. St000021The number of descents of a permutation. St000087The number of induced subgraphs. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000172The Grundy number of a graph. St000286The number of connected components of the complement of a graph. St000363The number of minimal vertex covers of a graph. St000469The distinguishing number of a graph. St000636The hull number of a graph. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000722The number of different neighbourhoods in a graph. St000919The number of maximal left branches of a binary tree. St000926The clique-coclique number of a graph. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St001029The size of the core of a graph. St001108The 2-dynamic chromatic number of a graph. St001110The 3-dynamic chromatic number of a graph. St001116The game chromatic number of a graph. St001280The number of parts of an integer partition that are at least two. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001316The domatic number of a graph. St001342The number of vertices in the center of a graph. St001354The number of series nodes in the modular decomposition of a graph. St001366The maximal multiplicity of a degree of a vertex of a graph. St001368The number of vertices of maximal degree in a graph. St001458The rank of the adjacency matrix of a graph. St001459The number of zero columns in the nullspace of a graph. St001494The Alon-Tarsi number of a graph. St001580The acyclic chromatic number of a graph. St001645The pebbling number of a connected graph. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St001670The connected partition number of a graph. St001707The length of a longest path in a graph such that the remaining vertices can be partitioned into two sets of the same size without edges between them. St001725The harmonious chromatic number of a graph. St001746The coalition number of a graph. St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St001883The mutual visibility number of a graph. St001963The tree-depth of a graph. St000300The number of independent sets of vertices of a graph. St000301The number of facets of the stable set polytope of a graph. St000325The width of the tree associated to a permutation. St000470The number of runs in a permutation. St001706The number of closed sets in a graph. St001568The smallest positive integer that does not appear twice in the partition. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St000834The number of right outer peaks of a permutation. St000257The number of distinct parts of a partition that occur at least twice. St001845The number of join irreducibles minus the rank of a lattice. St001613The binary logarithm of the size of the center of a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices. St001618The cardinality of the Frattini sublattice of a lattice. St001597The Frobenius rank of a skew partition. St001545The second Elser number of a connected graph. 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. St001960The number of descents of a permutation minus one if its first entry is not one. St001729The number of visible descents of a permutation. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001811The Castelnuovo-Mumford regularity of a permutation. St000252The number of nodes of degree 3 of a binary tree. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000897The number of different multiplicities of parts of an integer partition. 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. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001665The number of pure excedances of a permutation. St001737The number of descents of type 2 in a permutation. St001928The number of non-overlapping descents in a permutation. St000302The determinant of the distance matrix of a connected graph. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001616The number of neutral elements in a lattice. St001720The minimal length of a chain of small intervals in a lattice. St000632The jump number of the poset. St000768The number of peaks in an integer composition. St000807The sum of the heights of the valleys of the associated bargraph. St001570The minimal number of edges to add to make a graph Hamiltonian. St000264The girth of a graph, which is not a tree. St000281The size of the preimage of the map 'to poset' from Binary trees to Posets. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St001301The first Betti number of the order complex associated with the poset. St000914The sum of the values of the Möbius function of a poset. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St001635The trace of the square of the Coxeter matrix of the incidence algebra of a poset. St000298The order dimension or Dushnik-Miller dimension of a poset. St000640The rank of the largest boolean interval in a poset. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!