Your data matches 146 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000252
(load all 4 compositions to match this statistic)
Mapping
St000252: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[.,.]
 => 0
[.,[.,.]]
 => 0
[[.,.],.]
 => 0
[.,[.,[.,.]]]
 => 0
[.,[[.,.],.]]
 => 0
[[.,.],[.,.]]
 => 0
[[.,[.,.]],.]
 => 0
[[[.,.],.],.]
 => 0
[.,[.,[.,[.,.]]]]
 => 0
[.,[.,[[.,.],.]]]
 => 0
[.,[[.,.],[.,.]]]
 => 1
[.,[[.,[.,.]],.]]
 => 0
[.,[[[.,.],.],.]]
 => 0
[[.,.],[.,[.,.]]]
 => 0
[[.,.],[[.,.],.]]
 => 0
[[.,[.,.]],[.,.]]
 => 0
[[[.,.],.],[.,.]]
 => 0
[[.,[.,[.,.]]],.]
 => 0
[[.,[[.,.],.]],.]
 => 0
[[[.,.],[.,.]],.]
 => 1
[[[.,[.,.]],.],.]
 => 0
[[[[.,.],.],.],.]
 => 0
[.,[.,[.,[.,[.,.]]]]]
 => 0
[.,[.,[.,[[.,.],.]]]]
 => 0
[.,[.,[[.,.],[.,.]]]]
 => 1
[.,[.,[[.,[.,.]],.]]]
 => 0
[.,[.,[[[.,.],.],.]]]
 => 0
[.,[[.,.],[.,[.,.]]]]
 => 1
[.,[[.,.],[[.,.],.]]]
 => 1
[.,[[.,[.,.]],[.,.]]]
 => 1
[.,[[[.,.],.],[.,.]]]
 => 1
[.,[[.,[.,[.,.]]],.]]
 => 0
[.,[[.,[[.,.],.]],.]]
 => 0
[.,[[[.,.],[.,.]],.]]
 => 1
[.,[[[.,[.,.]],.],.]]
 => 0
[.,[[[[.,.],.],.],.]]
 => 0
[[.,.],[.,[.,[.,.]]]]
 => 0
[[.,.],[.,[[.,.],.]]]
 => 0
[[.,.],[[.,.],[.,.]]]
 => 1
[[.,.],[[.,[.,.]],.]]
 => 0
[[.,.],[[[.,.],.],.]]
 => 0
[[.,[.,.]],[.,[.,.]]]
 => 0
[[.,[.,.]],[[.,.],.]]
 => 0
[[[.,.],.],[.,[.,.]]]
 => 0
[[[.,.],.],[[.,.],.]]
 => 0
[[.,[.,[.,.]]],[.,.]]
 => 0
[[.,[[.,.],.]],[.,.]]
 => 0
[[[.,.],[.,.]],[.,.]]
 => 1
[[[.,[.,.]],.],[.,.]]
 => 0
[[[[.,.],.],.],[.,.]]
 => 0
Description
The number of nodes of degree 3 of a binary tree. Equivalently, the number of internal triangles in the associated triangulation of an $(n+2)$-gon.
Matching statistic: St001307
(load all 4 compositions to match this statistic)
Mapping
Mp00011: Binary trees —to graph⟶ Graphs
St001307: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[.,.]
 => ([],1)
 => 0
[.,[.,.]]
 => ([(0,1)],2)
 => 0
[[.,.],.]
 => ([(0,1)],2)
 => 0
[.,[.,[.,.]]]
 => ([(0,2),(1,2)],3)
 => 0
[.,[[.,.],.]]
 => ([(0,2),(1,2)],3)
 => 0
[[.,.],[.,.]]
 => ([(0,2),(1,2)],3)
 => 0
[[.,[.,.]],.]
 => ([(0,2),(1,2)],3)
 => 0
[[[.,.],.],.]
 => ([(0,2),(1,2)],3)
 => 0
[.,[.,[.,[.,.]]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[.,[[.,.],.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[[.,.],[.,.]]]
 => ([(0,3),(1,3),(2,3)],4)
 => 1
[.,[[.,[.,.]],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[[[.,.],.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,.],[.,[.,.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,.],[[.,.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[.,.]],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[[.,.],.],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[.,[.,.]]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[[.,.],.]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[[.,.],[.,.]],.]
 => ([(0,3),(1,3),(2,3)],4)
 => 1
[[[.,[.,.]],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[[[.,.],.],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[.,[.,[.,[.,.]]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[.,[.,[.,[[.,.],.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[.,[.,[[.,.],[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[.,[[.,[.,.]],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[.,[.,[[[.,.],.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[.,[[.,.],[.,[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[[.,.],[[.,.],.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[[.,[.,.]],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[[[.,.],.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[[.,[.,[.,.]]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[.,[[.,[[.,.],.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[.,[[[.,.],[.,.]],.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[[[.,[.,.]],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[.,[[[[.,.],.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[.,.],[.,[.,[.,.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[.,.],[.,[[.,.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[.,.],[[.,.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[[.,.],[[.,[.,.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[.,.],[[[.,.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[.,[.,.]],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[.,[.,.]],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[[.,.],.],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[[.,.],.],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[.,[.,[.,.]]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[.,[[.,.],.]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[[.,.],[.,.]],[.,.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[[[.,[.,.]],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[[[.,.],.],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
Description
The number of induced stars on four vertices in a graph.
Matching statistic: St001320
(load all 6 compositions to match this statistic)
Mapping
Mp00011: Binary trees —to graph⟶ Graphs
St001320: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[.,.]
 => ([],1)
 => 0
[.,[.,.]]
 => ([(0,1)],2)
 => 0
[[.,.],.]
 => ([(0,1)],2)
 => 0
[.,[.,[.,.]]]
 => ([(0,2),(1,2)],3)
 => 0
[.,[[.,.],.]]
 => ([(0,2),(1,2)],3)
 => 0
[[.,.],[.,.]]
 => ([(0,2),(1,2)],3)
 => 0
[[.,[.,.]],.]
 => ([(0,2),(1,2)],3)
 => 0
[[[.,.],.],.]
 => ([(0,2),(1,2)],3)
 => 0
[.,[.,[.,[.,.]]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[.,[[.,.],.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[[.,.],[.,.]]]
 => ([(0,3),(1,3),(2,3)],4)
 => 1
[.,[[.,[.,.]],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[[[.,.],.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,.],[.,[.,.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,.],[[.,.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[.,.]],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[[.,.],.],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[.,[.,.]]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[[.,.],.]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[[.,.],[.,.]],.]
 => ([(0,3),(1,3),(2,3)],4)
 => 1
[[[.,[.,.]],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[[[.,.],.],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[.,[.,[.,[.,.]]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[.,[.,[.,[[.,.],.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[.,[.,[[.,.],[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[.,[[.,[.,.]],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[.,[.,[[[.,.],.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[.,[[.,.],[.,[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[[.,.],[[.,.],.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[[.,[.,.]],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[[[.,.],.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[[.,[.,[.,.]]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[.,[[.,[[.,.],.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[.,[[[.,.],[.,.]],.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[[[.,[.,.]],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[.,[[[[.,.],.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[.,.],[.,[.,[.,.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[.,.],[.,[[.,.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[.,.],[[.,.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[[.,.],[[.,[.,.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[.,.],[[[.,.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[.,[.,.]],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[.,[.,.]],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[[.,.],.],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[[.,.],.],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[.,[.,[.,.]]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[.,[[.,.],.]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[[.,.],[.,.]],[.,.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[[[.,[.,.]],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
[[[[.,.],.],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 0
Description
The minimal number of occurrences of the path-pattern in a linear ordering of the vertices of the graph. A graph is a disjoint union of paths if and only if in any linear ordering of its vertices, there are no three vertices $a < b < c$ such that $(a,c)$ is an edge. This statistic is the minimal number of occurrences of this pattern, in the set of all linear orderings of the vertices.
Matching statistic: St001964
(load all 5 compositions to match this statistic)
Mapping
Mp00013: Binary trees —to poset⟶ Posets
St001964: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[.,.]
 => ([],1)
 => 0
[.,[.,.]]
 => ([(0,1)],2)
 => 0
[[.,.],.]
 => ([(0,1)],2)
 => 0
[.,[.,[.,.]]]
 => ([(0,2),(2,1)],3)
 => 0
[.,[[.,.],.]]
 => ([(0,2),(2,1)],3)
 => 0
[[.,.],[.,.]]
 => ([(0,2),(1,2)],3)
 => 0
[[.,[.,.]],.]
 => ([(0,2),(2,1)],3)
 => 0
[[[.,.],.],.]
 => ([(0,2),(2,1)],3)
 => 0
[.,[.,[.,[.,.]]]]
 => ([(0,3),(2,1),(3,2)],4)
 => 0
[.,[.,[[.,.],.]]]
 => ([(0,3),(2,1),(3,2)],4)
 => 0
[.,[[.,.],[.,.]]]
 => ([(0,3),(1,3),(3,2)],4)
 => 1
[.,[[.,[.,.]],.]]
 => ([(0,3),(2,1),(3,2)],4)
 => 0
[.,[[[.,.],.],.]]
 => ([(0,3),(2,1),(3,2)],4)
 => 0
[[.,.],[.,[.,.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,.],[[.,.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[.,.]],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[[.,.],.],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[.,[.,.]]],.]
 => ([(0,3),(2,1),(3,2)],4)
 => 0
[[.,[[.,.],.]],.]
 => ([(0,3),(2,1),(3,2)],4)
 => 0
[[[.,.],[.,.]],.]
 => ([(0,3),(1,3),(3,2)],4)
 => 1
[[[.,[.,.]],.],.]
 => ([(0,3),(2,1),(3,2)],4)
 => 0
[[[[.,.],.],.],.]
 => ([(0,3),(2,1),(3,2)],4)
 => 0
[.,[.,[.,[.,[.,.]]]]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 0
[.,[.,[.,[[.,.],.]]]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 0
[.,[.,[[.,.],[.,.]]]]
 => ([(0,4),(1,4),(2,3),(4,2)],5)
 => 1
[.,[.,[[.,[.,.]],.]]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 0
[.,[.,[[[.,.],.],.]]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 0
[.,[[.,.],[.,[.,.]]]]
 => ([(0,4),(1,2),(2,4),(4,3)],5)
 => 1
[.,[[.,.],[[.,.],.]]]
 => ([(0,4),(1,2),(2,4),(4,3)],5)
 => 1
[.,[[.,[.,.]],[.,.]]]
 => ([(0,4),(1,2),(2,4),(4,3)],5)
 => 1
[.,[[[.,.],.],[.,.]]]
 => ([(0,4),(1,2),(2,4),(4,3)],5)
 => 1
[.,[[.,[.,[.,.]]],.]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 0
[.,[[.,[[.,.],.]],.]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 0
[.,[[[.,.],[.,.]],.]]
 => ([(0,4),(1,4),(2,3),(4,2)],5)
 => 1
[.,[[[.,[.,.]],.],.]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 0
[.,[[[[.,.],.],.],.]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 0
[[.,.],[.,[.,[.,.]]]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 0
[[.,.],[.,[[.,.],.]]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 0
[[.,.],[[.,.],[.,.]]]
 => ([(0,4),(1,3),(2,3),(3,4)],5)
 => 1
[[.,.],[[.,[.,.]],.]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 0
[[.,.],[[[.,.],.],.]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 0
[[.,[.,.]],[.,[.,.]]]
 => ([(0,3),(1,2),(2,4),(3,4)],5)
 => 0
[[.,[.,.]],[[.,.],.]]
 => ([(0,3),(1,2),(2,4),(3,4)],5)
 => 0
[[[.,.],.],[.,[.,.]]]
 => ([(0,3),(1,2),(2,4),(3,4)],5)
 => 0
[[[.,.],.],[[.,.],.]]
 => ([(0,3),(1,2),(2,4),(3,4)],5)
 => 0
[[.,[.,[.,.]]],[.,.]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 0
[[.,[[.,.],.]],[.,.]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 0
[[[.,.],[.,.]],[.,.]]
 => ([(0,4),(1,3),(2,3),(3,4)],5)
 => 1
[[[.,[.,.]],.],[.,.]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 0
[[[[.,.],.],.],[.,.]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 0
Description
The interval resolution global dimension of a poset. This is the cardinality of the longest chain of right minimal approximations by interval modules of an indecomposable module over the incidence algebra.
Matching statistic: St000095
(load all 2 compositions to match this statistic)
Mapping
Mp00011: Binary trees —to graph⟶ Graphs
Mp00250: Graphs —clique graph⟶ Graphs
St000095: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[.,.]
 => ([],1)
 => ([],1)
 => 0
[.,[.,.]]
 => ([(0,1)],2)
 => ([],1)
 => 0
[[.,.],.]
 => ([(0,1)],2)
 => ([],1)
 => 0
[.,[.,[.,.]]]
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
[.,[[.,.],.]]
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
[[.,.],[.,.]]
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
[[.,[.,.]],.]
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
[[[.,.],.],.]
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
[.,[.,[.,[.,.]]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[.,[.,[[.,.],.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[.,[[.,.],[.,.]]]
 => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1
[.,[[.,[.,.]],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[.,[[[.,.],.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[.,.],[.,[.,.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[.,.],[[.,.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[.,[.,.]],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[[.,.],.],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[.,[.,[.,.]]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[.,[[.,.],.]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[[.,.],[.,.]],.]
 => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1
[[[.,[.,.]],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[[[.,.],.],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[.,[.,[.,[.,[.,.]]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[.,[.,[[.,.],.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[.,[[.,.],[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[.,[[.,[.,.]],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[.,[[[.,.],.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[[.,.],[.,[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[[.,.],[[.,.],.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[[.,[.,.]],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[[[.,.],.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[[.,[.,[.,.]]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[[.,[[.,.],.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[[[.,.],[.,.]],.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[[[.,[.,.]],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[[[[.,.],.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,.],[.,[.,[.,.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,.],[.,[[.,.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,.],[[.,.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[[.,.],[[.,[.,.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,.],[[[.,.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[.,.]],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[.,.]],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[[.,.],.],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[[.,.],.],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[.,[.,.]]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[[.,.],.]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[[.,.],[.,.]],[.,.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[[[.,[.,.]],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[[[.,.],.],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
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: St001309
(load all 2 compositions to match this statistic)
Mapping
Mp00011: Binary trees —to graph⟶ Graphs
Mp00147: Graphs —square⟶ Graphs
St001309: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[.,.]
 => ([],1)
 => ([],1)
 => 0
[.,[.,.]]
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
[[.,.],.]
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
[.,[.,[.,.]]]
 => ([(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
[.,[[.,.],.]]
 => ([(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
[[.,.],[.,.]]
 => ([(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
[[.,[.,.]],.]
 => ([(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
[[[.,.],.],.]
 => ([(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
[.,[.,[.,[.,.]]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[.,[.,[[.,.],.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[.,[[.,.],[.,.]]]
 => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[[.,[.,.]],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[.,[[[.,.],.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[[.,.],[.,[.,.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[[.,.],[[.,.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[[.,[.,.]],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[[[.,.],.],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[[.,[.,[.,.]]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[[.,[[.,.],.]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[[[.,.],[.,.]],.]
 => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[[[.,[.,.]],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[[[[.,.],.],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[.,[.,[.,[.,[.,.]]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[.,[.,[.,[[.,.],.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[.,[.,[[.,.],[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1
[.,[.,[[.,[.,.]],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[.,[.,[[[.,.],.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[.,[[.,.],[.,[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1
[.,[[.,.],[[.,.],.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1
[.,[[.,[.,.]],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1
[.,[[[.,.],.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1
[.,[[.,[.,[.,.]]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[.,[[.,[[.,.],.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[.,[[[.,.],[.,.]],.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1
[.,[[[.,[.,.]],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[.,[[[[.,.],.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[.,.],[.,[.,[.,.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[.,.],[.,[[.,.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[.,.],[[.,.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1
[[.,.],[[.,[.,.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[.,.],[[[.,.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[.,[.,.]],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[.,[.,.]],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[[.,.],.],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[[.,.],.],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[.,[.,[.,.]]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[.,[[.,.],.]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[[.,.],[.,.]],[.,.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1
[[[.,[.,.]],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[[[.,.],.],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
Description
The number of four-cliques in a graph.
Matching statistic: St001311
(load all 2 compositions to match this statistic)
Mapping
Mp00011: Binary trees —to graph⟶ Graphs
Mp00250: Graphs —clique graph⟶ Graphs
St001311: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[.,.]
 => ([],1)
 => ([],1)
 => 0
[.,[.,.]]
 => ([(0,1)],2)
 => ([],1)
 => 0
[[.,.],.]
 => ([(0,1)],2)
 => ([],1)
 => 0
[.,[.,[.,.]]]
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
[.,[[.,.],.]]
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
[[.,.],[.,.]]
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
[[.,[.,.]],.]
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
[[[.,.],.],.]
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
[.,[.,[.,[.,.]]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[.,[.,[[.,.],.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[.,[[.,.],[.,.]]]
 => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1
[.,[[.,[.,.]],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[.,[[[.,.],.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[.,.],[.,[.,.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[.,.],[[.,.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[.,[.,.]],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[[.,.],.],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[.,[.,[.,.]]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[.,[[.,.],.]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[[.,.],[.,.]],.]
 => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1
[[[.,[.,.]],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[[[.,.],.],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[.,[.,[.,[.,[.,.]]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[.,[.,[[.,.],.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[.,[[.,.],[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[.,[[.,[.,.]],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[.,[[[.,.],.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[[.,.],[.,[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[[.,.],[[.,.],.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[[.,[.,.]],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[[[.,.],.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[[.,[.,[.,.]]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[[.,[[.,.],.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[[[.,.],[.,.]],.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[[[.,[.,.]],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[[[[.,.],.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,.],[.,[.,[.,.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,.],[.,[[.,.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,.],[[.,.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[[.,.],[[.,[.,.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,.],[[[.,.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[.,.]],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[.,.]],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[[.,.],.],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[[.,.],.],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[.,[.,.]]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[[.,.],.]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[[.,.],[.,.]],[.,.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[[[.,[.,.]],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[[[.,.],.],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
Description
The cyclomatic number of a graph. This is the minimum number of edges that must be removed from the graph so that the result is a forest. This is also the first Betti number of the graph. It can be computed as $c + m - n$, where $c$ is the number of connected components, $m$ is the number of edges and $n$ is the number of vertices.
Matching statistic: St001317
(load all 2 compositions to match this statistic)
Mapping
Mp00011: Binary trees —to graph⟶ Graphs
Mp00250: Graphs —clique graph⟶ Graphs
St001317: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[.,.]
 => ([],1)
 => ([],1)
 => 0
[.,[.,.]]
 => ([(0,1)],2)
 => ([],1)
 => 0
[[.,.],.]
 => ([(0,1)],2)
 => ([],1)
 => 0
[.,[.,[.,.]]]
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
[.,[[.,.],.]]
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
[[.,.],[.,.]]
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
[[.,[.,.]],.]
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
[[[.,.],.],.]
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
[.,[.,[.,[.,.]]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[.,[.,[[.,.],.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[.,[[.,.],[.,.]]]
 => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1
[.,[[.,[.,.]],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[.,[[[.,.],.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[.,.],[.,[.,.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[.,.],[[.,.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[.,[.,.]],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[[.,.],.],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[.,[.,[.,.]]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[.,[[.,.],.]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[[.,.],[.,.]],.]
 => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1
[[[.,[.,.]],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[[[.,.],.],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[.,[.,[.,[.,[.,.]]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[.,[.,[[.,.],.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[.,[[.,.],[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[.,[[.,[.,.]],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[.,[[[.,.],.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[[.,.],[.,[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[[.,.],[[.,.],.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[[.,[.,.]],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[[[.,.],.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[[.,[.,[.,.]]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[[.,[[.,.],.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[[[.,.],[.,.]],.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[[[.,[.,.]],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[[[[.,.],.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,.],[.,[.,[.,.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,.],[.,[[.,.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,.],[[.,.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[[.,.],[[.,[.,.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,.],[[[.,.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[.,.]],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[.,.]],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[[.,.],.],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[[.,.],.],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[.,[.,.]]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[[.,.],.]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[[.,.],[.,.]],[.,.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[[[.,[.,.]],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[[[.,.],.],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
Description
The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the graph. A graph is a forest if and only if in any linear ordering of its vertices, there are no three vertices $a < b < c$ such that $(a,c)$ and $(b,c)$ are edges. This statistic is the minimal number of occurrences of this pattern, in the set of all linear orderings of the vertices.
Matching statistic: St001328
(load all 2 compositions to match this statistic)
Mapping
Mp00011: Binary trees —to graph⟶ Graphs
Mp00250: Graphs —clique graph⟶ Graphs
St001328: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[.,.]
 => ([],1)
 => ([],1)
 => 0
[.,[.,.]]
 => ([(0,1)],2)
 => ([],1)
 => 0
[[.,.],.]
 => ([(0,1)],2)
 => ([],1)
 => 0
[.,[.,[.,.]]]
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
[.,[[.,.],.]]
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
[[.,.],[.,.]]
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
[[.,[.,.]],.]
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
[[[.,.],.],.]
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
[.,[.,[.,[.,.]]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[.,[.,[[.,.],.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[.,[[.,.],[.,.]]]
 => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1
[.,[[.,[.,.]],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[.,[[[.,.],.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[.,.],[.,[.,.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[.,.],[[.,.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[.,[.,.]],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[[.,.],.],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[.,[.,[.,.]]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[.,[[.,.],.]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[[.,.],[.,.]],.]
 => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1
[[[.,[.,.]],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[[[[.,.],.],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
[.,[.,[.,[.,[.,.]]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[.,[.,[[.,.],.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[.,[[.,.],[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[.,[[.,[.,.]],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[.,[[[.,.],.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[[.,.],[.,[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[[.,.],[[.,.],.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[[.,[.,.]],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[[[.,.],.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[[.,[.,[.,.]]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[[.,[[.,.],.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[[[.,.],[.,.]],.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[[[.,[.,.]],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[.,[[[[.,.],.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,.],[.,[.,[.,.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,.],[.,[[.,.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,.],[[.,.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[[.,.],[[.,[.,.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,.],[[[.,.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[.,.]],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[.,.]],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[[.,.],.],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[[.,.],.],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[.,[.,.]]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[.,[[.,.],.]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[[.,.],[.,.]],[.,.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[[[.,[.,.]],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
[[[[.,.],.],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
Description
The minimal number of occurrences of the bipartite-pattern in a linear ordering of the vertices of the graph. A graph is bipartite 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. This statistic is the minimal number of occurrences of this pattern, in the set of all linear orderings of the vertices.
Matching statistic: St001329
(load all 3 compositions to match this statistic)
Mapping
Mp00011: Binary trees —to graph⟶ Graphs
Mp00147: Graphs —square⟶ Graphs
St001329: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[.,.]
 => ([],1)
 => ([],1)
 => 0
[.,[.,.]]
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
[[.,.],.]
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
[.,[.,[.,.]]]
 => ([(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
[.,[[.,.],.]]
 => ([(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
[[.,.],[.,.]]
 => ([(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
[[.,[.,.]],.]
 => ([(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
[[[.,.],.],.]
 => ([(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
[.,[.,[.,[.,.]]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[.,[.,[[.,.],.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[.,[[.,.],[.,.]]]
 => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[.,[[.,[.,.]],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[.,[[[.,.],.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[[.,.],[.,[.,.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[[.,.],[[.,.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[[.,[.,.]],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[[[.,.],.],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[[.,[.,[.,.]]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[[.,[[.,.],.]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[[[.,.],[.,.]],.]
 => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1
[[[.,[.,.]],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[[[[.,.],.],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
[.,[.,[.,[.,[.,.]]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[.,[.,[.,[[.,.],.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[.,[.,[[.,.],[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1
[.,[.,[[.,[.,.]],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[.,[.,[[[.,.],.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[.,[[.,.],[.,[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1
[.,[[.,.],[[.,.],.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1
[.,[[.,[.,.]],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1
[.,[[[.,.],.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1
[.,[[.,[.,[.,.]]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[.,[[.,[[.,.],.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[.,[[[.,.],[.,.]],.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1
[.,[[[.,[.,.]],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[.,[[[[.,.],.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[.,.],[.,[.,[.,.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[.,.],[.,[[.,.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[.,.],[[.,.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1
[[.,.],[[.,[.,.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[.,.],[[[.,.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[.,[.,.]],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[.,[.,.]],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[[.,.],.],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[[.,.],.],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[.,[.,[.,.]]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[.,[[.,.],.]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[[.,.],[.,.]],[.,.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1
[[[.,[.,.]],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
[[[[.,.],.],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
Description
The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph. A graph is outerplanar if and only if in any linear ordering of its vertices, there are no four vertices $a < b < c < d$ such that $(a,c)$ and $(b,d)$ are edges. This statistic is the minimal number of occurrences of this pattern, in the set of all linear orderings of the vertices.
The following 136 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001334The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph. St001572The minimal number of edges to remove to make a graph bipartite. St001573The minimal number of edges to remove to make a graph triangle-free. St001728The number of invisible descents of a permutation. St001736The total number of cycles in a graph. St001871The number of triconnected components of a graph. St000450The number of edges minus the number of vertices plus 2 of a graph. St000482The (zero)-forcing number of a graph. St000023The number of inner peaks of a permutation. St000386The number of factors DDU in a Dyck path. St000647The number of big descents of a permutation. St001083The number of boxed occurrences of 132 in a permutation. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St000092The number of outer peaks of a permutation. St000196The number of occurrences of the contiguous pattern [[.,.],[.,. St000292The number of ascents of a binary word. St000353The number of inner valleys of a permutation. St000779The tier of a permutation. St001712The number of natural descents of a standard Young tableau. St000099The number of valleys of a permutation, including the boundary. St000201The number of leaf nodes in a binary tree. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000646The number of big ascents of a permutation. St000291The number of descents of a binary word. St001960The number of descents of a permutation minus one if its first entry is not one. St000256The number of parts from which one can substract 2 and still get an integer partition. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St001280The number of parts of an integer partition that are at least two. St001587Half of the largest even part of an integer partition. St001657The number of twos in an integer partition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000934The 2-degree of an integer partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St000455The second largest eigenvalue of a graph if it is integral. St000929The constant term of the character polynomial of an integer partition. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St000908The length of the shortest maximal antichain in a poset. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St001638The book thickness of a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. St001118The acyclic chromatic index of a graph. St000302The determinant of the distance matrix 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. St001578The minimal number of edges to add or remove to make a graph a line graph. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. 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)$. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001734The lettericity of a graph. St001570The minimal number of edges to add to make a graph Hamiltonian. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000466The Gutman (or modified Schultz) index of a connected graph. St000467The hyper-Wiener index of a connected graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001645The pebbling number of a connected graph. St001330The hat guessing number of a graph. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001720The minimal length of a chain of small intervals in a lattice. St000327The number of cover relations in a poset. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001498The normalised height of a Nakayama algebra with magnitude 1. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St000409The number of pitchforks in a binary tree. St000478Another weight of a partition according to Alladi. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000567The sum of the products of all pairs of parts. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000681The Grundy value of Chomp on Ferrers diagrams. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000936The number of even values of the symmetric group character corresponding to the partition. St000941The number of characters of the symmetric group whose value on the partition is even. 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. 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. St001128The exponens consonantiae of a partition. St001845The number of join irreducibles minus the rank of a lattice. St000741The Colin de Verdière graph invariant. St000181The number of connected components of the Hasse diagram for the poset. St001490The number of connected components of a skew partition. St001862The number of crossings of a signed permutation. St001866The nesting alignments of a signed permutation. St001868The number of alignments of type NE of a signed permutation. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001282The number of graphs with the same chromatic polynomial. St001890The maximum magnitude of the Möbius function of a poset. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St000068The number of minimal elements in a poset. St001095The number of non-isomorphic posets with precisely one further covering relation. St001301The first Betti number of the order complex associated with the poset. St001396Number of triples of incomparable elements in a finite poset. St000914The sum of the values of the Möbius function of a poset. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001533The largest coefficient of the Poincare polynomial of the poset cone. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St001060The distinguishing index of a graph. St001281The normalized isoperimetric number of a graph. 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. St000629The defect of a binary word. St000383The last part of an integer composition. St001867The number of alignments of type EN of a signed permutation. St000407The number of occurrences of the pattern 2143 in a permutation. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001171The vector space dimension of $Ext_A^1(I_o,A)$ when $I_o$ is the tilting module corresponding to the permutation $o$ in the Auslander algebra $A$ of $K[x]/(x^n)$. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St000902 The minimal number of repetitions of an integer composition. 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. St001413Half the length of the longest even length palindromic prefix of a binary word. St001768The number of reduced words of a signed permutation. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000793The length of the longest partition in the vacillating tableau corresponding to a set partition. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St000445The number of rises of length 1 of a Dyck path. St001207The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. 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. St001651The Frankl number of a lattice.