Your data matches 460 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000272
(load all 6 compositions to match this statistic)
Mapping
Mp00011: Binary trees —to graph⟶ Graphs
St000272: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[.,.]
 => ([],1)
 => 0
[.,[.,.]]
 => ([(0,1)],2)
 => 1
[[.,.],.]
 => ([(0,1)],2)
 => 1
[.,[.,[.,.]]]
 => ([(0,2),(1,2)],3)
 => 1
[.,[[.,.],.]]
 => ([(0,2),(1,2)],3)
 => 1
[[.,.],[.,.]]
 => ([(0,2),(1,2)],3)
 => 1
[[.,[.,.]],.]
 => ([(0,2),(1,2)],3)
 => 1
[[[.,.],.],.]
 => ([(0,2),(1,2)],3)
 => 1
[.,[.,[.,[.,.]]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[.,[[.,.],.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[[.,.],[.,.]]]
 => ([(0,3),(1,3),(2,3)],4)
 => 1
[.,[[.,[.,.]],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[[[.,.],.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,.],[.,[.,.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,.],[[.,.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,[.,.]],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[[.,.],.],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,[.,[.,.]]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,[[.,.],.]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[[.,.],[.,.]],.]
 => ([(0,3),(1,3),(2,3)],4)
 => 1
[[[.,[.,.]],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[[[.,.],.],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[.,[.,[.,[.,.]]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[.,[.,[[.,.],.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[.,[[.,.],[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[.,[[.,[.,.]],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[.,[[[.,.],.],.]]]
 => ([(0,4),(1,3),(2,3),(2,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,4),(2,3),(3,4)],5)
 => 1
[.,[[.,[.,[.,.]]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[[.,[[.,.],.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[[[.,.],[.,.]],.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[[[.,[.,.]],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[[[[.,.],.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[.,[.,[.,.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[.,[[.,.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[[.,.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[[.,.],[[.,[.,.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[[[.,.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[.,.]],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[.,.]],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[.,.],.],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[.,.],.],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[.,[.,.]]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[[.,.],.]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[.,.],[.,.]],[.,.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[[[.,[.,.]],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[[.,.],.],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
Description
The treewidth of a graph. A graph has treewidth zero if and only if it has no edges. A connected graph has treewidth at most one if and only if it is a tree. A connected graph has treewidth at most two if and only if it is a series-parallel graph.
Matching statistic: St000535
(load all 10 compositions to match this statistic)
Mapping
Mp00011: Binary trees —to graph⟶ Graphs
St000535: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[.,.]
 => ([],1)
 => 0
[.,[.,.]]
 => ([(0,1)],2)
 => 1
[[.,.],.]
 => ([(0,1)],2)
 => 1
[.,[.,[.,.]]]
 => ([(0,2),(1,2)],3)
 => 1
[.,[[.,.],.]]
 => ([(0,2),(1,2)],3)
 => 1
[[.,.],[.,.]]
 => ([(0,2),(1,2)],3)
 => 1
[[.,[.,.]],.]
 => ([(0,2),(1,2)],3)
 => 1
[[[.,.],.],.]
 => ([(0,2),(1,2)],3)
 => 1
[.,[.,[.,[.,.]]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[.,[[.,.],.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[[.,.],[.,.]]]
 => ([(0,3),(1,3),(2,3)],4)
 => 1
[.,[[.,[.,.]],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[[[.,.],.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,.],[.,[.,.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,.],[[.,.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,[.,.]],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[[.,.],.],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,[.,[.,.]]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,[[.,.],.]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[[.,.],[.,.]],.]
 => ([(0,3),(1,3),(2,3)],4)
 => 1
[[[.,[.,.]],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[[[.,.],.],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[.,[.,[.,[.,.]]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[.,[.,[[.,.],.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[.,[[.,.],[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[.,[[.,[.,.]],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[.,[[[.,.],.],.]]]
 => ([(0,4),(1,3),(2,3),(2,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,4),(2,3),(3,4)],5)
 => 1
[.,[[.,[.,[.,.]]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[[.,[[.,.],.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[[[.,.],[.,.]],.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[[[.,[.,.]],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[[[[.,.],.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[.,[.,[.,.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[.,[[.,.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[[.,.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[[.,.],[[.,[.,.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[[[.,.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[.,.]],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[.,.]],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[.,.],.],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[.,.],.],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[.,[.,.]]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[[.,.],.]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[.,.],[.,.]],[.,.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[[[.,[.,.]],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[[.,.],.],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
Description
The rank-width of a graph.
Matching statistic: St000845
(load all 2 compositions to match this statistic)
Mapping
Mp00013: Binary trees —to poset⟶ Posets
St000845: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[.,.]
 => ([],1)
 => 0
[.,[.,.]]
 => ([(0,1)],2)
 => 1
[[.,.],.]
 => ([(0,1)],2)
 => 1
[.,[.,[.,.]]]
 => ([(0,2),(2,1)],3)
 => 1
[.,[[.,.],.]]
 => ([(0,2),(2,1)],3)
 => 1
[[.,.],[.,.]]
 => ([(0,2),(1,2)],3)
 => 1
[[.,[.,.]],.]
 => ([(0,2),(2,1)],3)
 => 1
[[[.,.],.],.]
 => ([(0,2),(2,1)],3)
 => 1
[.,[.,[.,[.,.]]]]
 => ([(0,3),(2,1),(3,2)],4)
 => 1
[.,[.,[[.,.],.]]]
 => ([(0,3),(2,1),(3,2)],4)
 => 1
[.,[[.,.],[.,.]]]
 => ([(0,3),(1,3),(3,2)],4)
 => 1
[.,[[.,[.,.]],.]]
 => ([(0,3),(2,1),(3,2)],4)
 => 1
[.,[[[.,.],.],.]]
 => ([(0,3),(2,1),(3,2)],4)
 => 1
[[.,.],[.,[.,.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,.],[[.,.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,[.,.]],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[[.,.],.],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,[.,[.,.]]],.]
 => ([(0,3),(2,1),(3,2)],4)
 => 1
[[.,[[.,.],.]],.]
 => ([(0,3),(2,1),(3,2)],4)
 => 1
[[[.,.],[.,.]],.]
 => ([(0,3),(1,3),(3,2)],4)
 => 1
[[[.,[.,.]],.],.]
 => ([(0,3),(2,1),(3,2)],4)
 => 1
[[[[.,.],.],.],.]
 => ([(0,3),(2,1),(3,2)],4)
 => 1
[.,[.,[.,[.,[.,.]]]]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 1
[.,[.,[.,[[.,.],.]]]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 1
[.,[.,[[.,.],[.,.]]]]
 => ([(0,4),(1,4),(2,3),(4,2)],5)
 => 1
[.,[.,[[.,[.,.]],.]]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 1
[.,[.,[[[.,.],.],.]]]
 => ([(0,4),(2,3),(3,1),(4,2)],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),(1,2),(2,4),(4,3)],5)
 => 1
[.,[[.,[.,[.,.]]],.]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 1
[.,[[.,[[.,.],.]],.]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 1
[.,[[[.,.],[.,.]],.]]
 => ([(0,4),(1,4),(2,3),(4,2)],5)
 => 1
[.,[[[.,[.,.]],.],.]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 1
[.,[[[[.,.],.],.],.]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 1
[[.,.],[.,[.,[.,.]]]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 1
[[.,.],[.,[[.,.],.]]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 1
[[.,.],[[.,.],[.,.]]]
 => ([(0,4),(1,3),(2,3),(3,4)],5)
 => 1
[[.,.],[[.,[.,.]],.]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 1
[[.,.],[[[.,.],.],.]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 1
[[.,[.,.]],[.,[.,.]]]
 => ([(0,3),(1,2),(2,4),(3,4)],5)
 => 1
[[.,[.,.]],[[.,.],.]]
 => ([(0,3),(1,2),(2,4),(3,4)],5)
 => 1
[[[.,.],.],[.,[.,.]]]
 => ([(0,3),(1,2),(2,4),(3,4)],5)
 => 1
[[[.,.],.],[[.,.],.]]
 => ([(0,3),(1,2),(2,4),(3,4)],5)
 => 1
[[.,[.,[.,.]]],[.,.]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 1
[[.,[[.,.],.]],[.,.]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 1
[[[.,.],[.,.]],[.,.]]
 => ([(0,4),(1,3),(2,3),(3,4)],5)
 => 1
[[[.,[.,.]],.],[.,.]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 1
[[[[.,.],.],.],[.,.]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 1
Description
The maximal number of elements covered by an element in a poset.
Matching statistic: St001271
(load all 13 compositions to match this statistic)
Mapping
Mp00011: Binary trees —to graph⟶ Graphs
St001271: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[.,.]
 => ([],1)
 => 0
[.,[.,.]]
 => ([(0,1)],2)
 => 1
[[.,.],.]
 => ([(0,1)],2)
 => 1
[.,[.,[.,.]]]
 => ([(0,2),(1,2)],3)
 => 1
[.,[[.,.],.]]
 => ([(0,2),(1,2)],3)
 => 1
[[.,.],[.,.]]
 => ([(0,2),(1,2)],3)
 => 1
[[.,[.,.]],.]
 => ([(0,2),(1,2)],3)
 => 1
[[[.,.],.],.]
 => ([(0,2),(1,2)],3)
 => 1
[.,[.,[.,[.,.]]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[.,[[.,.],.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[[.,.],[.,.]]]
 => ([(0,3),(1,3),(2,3)],4)
 => 1
[.,[[.,[.,.]],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[[[.,.],.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,.],[.,[.,.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,.],[[.,.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,[.,.]],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[[.,.],.],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,[.,[.,.]]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,[[.,.],.]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[[.,.],[.,.]],.]
 => ([(0,3),(1,3),(2,3)],4)
 => 1
[[[.,[.,.]],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[[[.,.],.],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[.,[.,[.,[.,.]]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[.,[.,[[.,.],.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[.,[[.,.],[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[.,[[.,[.,.]],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[.,[[[.,.],.],.]]]
 => ([(0,4),(1,3),(2,3),(2,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,4),(2,3),(3,4)],5)
 => 1
[.,[[.,[.,[.,.]]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[[.,[[.,.],.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[[[.,.],[.,.]],.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[[[.,[.,.]],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[[[[.,.],.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[.,[.,[.,.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[.,[[.,.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[[.,.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[[.,.],[[.,[.,.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[[[.,.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[.,.]],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[.,.]],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[.,.],.],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[.,.],.],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[.,[.,.]]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[[.,.],.]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[.,.],[.,.]],[.,.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[[[.,[.,.]],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[[.,.],.],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
Description
The competition number of a graph. The competition graph of a digraph $D$ is a (simple undirected) graph which has the same vertex set as $D$ and has an edge between $x$ and $y$ if and only if there exists a vertex $v$ in $D$ such that $(x, v)$ and $(y, v)$ are arcs of $D$. For any graph, $G$ together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. The competition number $k(G)$ is the smallest number of such isolated vertices.
Matching statistic: St001277
(load all 6 compositions to match this statistic)
Mapping
Mp00011: Binary trees —to graph⟶ Graphs
St001277: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[.,.]
 => ([],1)
 => 0
[.,[.,.]]
 => ([(0,1)],2)
 => 1
[[.,.],.]
 => ([(0,1)],2)
 => 1
[.,[.,[.,.]]]
 => ([(0,2),(1,2)],3)
 => 1
[.,[[.,.],.]]
 => ([(0,2),(1,2)],3)
 => 1
[[.,.],[.,.]]
 => ([(0,2),(1,2)],3)
 => 1
[[.,[.,.]],.]
 => ([(0,2),(1,2)],3)
 => 1
[[[.,.],.],.]
 => ([(0,2),(1,2)],3)
 => 1
[.,[.,[.,[.,.]]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[.,[[.,.],.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[[.,.],[.,.]]]
 => ([(0,3),(1,3),(2,3)],4)
 => 1
[.,[[.,[.,.]],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[[[.,.],.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,.],[.,[.,.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,.],[[.,.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,[.,.]],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[[.,.],.],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,[.,[.,.]]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,[[.,.],.]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[[.,.],[.,.]],.]
 => ([(0,3),(1,3),(2,3)],4)
 => 1
[[[.,[.,.]],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[[[.,.],.],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[.,[.,[.,[.,.]]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[.,[.,[[.,.],.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[.,[[.,.],[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[.,[[.,[.,.]],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[.,[[[.,.],.],.]]]
 => ([(0,4),(1,3),(2,3),(2,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,4),(2,3),(3,4)],5)
 => 1
[.,[[.,[.,[.,.]]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[[.,[[.,.],.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[[[.,.],[.,.]],.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[[[.,[.,.]],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[[[[.,.],.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[.,[.,[.,.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[.,[[.,.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[[.,.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[[.,.],[[.,[.,.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[[[.,.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[.,.]],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[.,.]],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[.,.],.],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[.,.],.],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[.,[.,.]]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[[.,.],.]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[.,.],[.,.]],[.,.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[[[.,[.,.]],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[[.,.],.],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
Description
The degeneracy of a graph. The degeneracy of a graph $G$ is the maximum of the minimum degrees of the (vertex induced) subgraphs of $G$.
Matching statistic: St001358
(load all 6 compositions to match this statistic)
Mapping
Mp00011: Binary trees —to graph⟶ Graphs
St001358: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[.,.]
 => ([],1)
 => 0
[.,[.,.]]
 => ([(0,1)],2)
 => 1
[[.,.],.]
 => ([(0,1)],2)
 => 1
[.,[.,[.,.]]]
 => ([(0,2),(1,2)],3)
 => 1
[.,[[.,.],.]]
 => ([(0,2),(1,2)],3)
 => 1
[[.,.],[.,.]]
 => ([(0,2),(1,2)],3)
 => 1
[[.,[.,.]],.]
 => ([(0,2),(1,2)],3)
 => 1
[[[.,.],.],.]
 => ([(0,2),(1,2)],3)
 => 1
[.,[.,[.,[.,.]]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[.,[[.,.],.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[[.,.],[.,.]]]
 => ([(0,3),(1,3),(2,3)],4)
 => 1
[.,[[.,[.,.]],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[[[.,.],.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,.],[.,[.,.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,.],[[.,.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,[.,.]],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[[.,.],.],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,[.,[.,.]]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,[[.,.],.]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[[.,.],[.,.]],.]
 => ([(0,3),(1,3),(2,3)],4)
 => 1
[[[.,[.,.]],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[[[.,.],.],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[.,[.,[.,[.,.]]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[.,[.,[[.,.],.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[.,[[.,.],[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[.,[[.,[.,.]],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[.,[[[.,.],.],.]]]
 => ([(0,4),(1,3),(2,3),(2,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,4),(2,3),(3,4)],5)
 => 1
[.,[[.,[.,[.,.]]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[[.,[[.,.],.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[[[.,.],[.,.]],.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[[[.,[.,.]],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[[[[.,.],.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[.,[.,[.,.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[.,[[.,.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[[.,.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[[.,.],[[.,[.,.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[[[.,.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[.,.]],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[.,.]],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[.,.],.],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[.,.],.],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[.,[.,.]]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[[.,.],.]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[.,.],[.,.]],[.,.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[[[.,[.,.]],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[[.,.],.],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
Description
The largest degree of a regular subgraph of a graph. For $k > 2$, it is an NP-complete problem to determine whether a graph has a $k$-regular subgraph, see [1].
Matching statistic: St001743
(load all 6 compositions to match this statistic)
Mapping
Mp00011: Binary trees —to graph⟶ Graphs
St001743: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[.,.]
 => ([],1)
 => 0
[.,[.,.]]
 => ([(0,1)],2)
 => 1
[[.,.],.]
 => ([(0,1)],2)
 => 1
[.,[.,[.,.]]]
 => ([(0,2),(1,2)],3)
 => 1
[.,[[.,.],.]]
 => ([(0,2),(1,2)],3)
 => 1
[[.,.],[.,.]]
 => ([(0,2),(1,2)],3)
 => 1
[[.,[.,.]],.]
 => ([(0,2),(1,2)],3)
 => 1
[[[.,.],.],.]
 => ([(0,2),(1,2)],3)
 => 1
[.,[.,[.,[.,.]]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[.,[[.,.],.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[[.,.],[.,.]]]
 => ([(0,3),(1,3),(2,3)],4)
 => 1
[.,[[.,[.,.]],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[[[.,.],.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,.],[.,[.,.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,.],[[.,.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,[.,.]],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[[.,.],.],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,[.,[.,.]]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,[[.,.],.]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[[.,.],[.,.]],.]
 => ([(0,3),(1,3),(2,3)],4)
 => 1
[[[.,[.,.]],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[[[.,.],.],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[.,[.,[.,[.,.]]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[.,[.,[[.,.],.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[.,[[.,.],[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[.,[[.,[.,.]],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[.,[[[.,.],.],.]]]
 => ([(0,4),(1,3),(2,3),(2,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,4),(2,3),(3,4)],5)
 => 1
[.,[[.,[.,[.,.]]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[[.,[[.,.],.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[[[.,.],[.,.]],.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[[[.,[.,.]],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[[[[.,.],.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[.,[.,[.,.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[.,[[.,.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[[.,.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[[.,.],[[.,[.,.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[[[.,.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[.,.]],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[.,.]],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[.,.],.],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[.,.],.],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[.,[.,.]]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[[.,.],.]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[.,.],[.,.]],[.,.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[[[.,[.,.]],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[[.,.],.],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
Description
The discrepancy of a graph. For a subset $C$ of the set of vertices $V(G)$, and a vertex $v$, let $d_{C, v} = |\#(N(v)\cap C) - \#(N(v)\cap(V\setminus C))|$, and let $d_C$ be the maximal value of $d_{C, v}$ over all vertices. Then the discrepancy of the graph is the minimal value of $d_C$ over all subsets of $V(G)$. Graphs with at most $8$ vertices have discrepancy at most $2$, but there are graphs with arbitrary discrepancy.
Matching statistic: St001792
(load all 6 compositions to match this statistic)
Mapping
Mp00011: Binary trees —to graph⟶ Graphs
St001792: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[.,.]
 => ([],1)
 => 0
[.,[.,.]]
 => ([(0,1)],2)
 => 1
[[.,.],.]
 => ([(0,1)],2)
 => 1
[.,[.,[.,.]]]
 => ([(0,2),(1,2)],3)
 => 1
[.,[[.,.],.]]
 => ([(0,2),(1,2)],3)
 => 1
[[.,.],[.,.]]
 => ([(0,2),(1,2)],3)
 => 1
[[.,[.,.]],.]
 => ([(0,2),(1,2)],3)
 => 1
[[[.,.],.],.]
 => ([(0,2),(1,2)],3)
 => 1
[.,[.,[.,[.,.]]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[.,[[.,.],.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[[.,.],[.,.]]]
 => ([(0,3),(1,3),(2,3)],4)
 => 1
[.,[[.,[.,.]],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[[[.,.],.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,.],[.,[.,.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,.],[[.,.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,[.,.]],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[[.,.],.],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,[.,[.,.]]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[.,[[.,.],.]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[[.,.],[.,.]],.]
 => ([(0,3),(1,3),(2,3)],4)
 => 1
[[[.,[.,.]],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[[[[.,.],.],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 1
[.,[.,[.,[.,[.,.]]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[.,[.,[[.,.],.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[.,[[.,.],[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[.,[[.,[.,.]],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[.,[[[.,.],.],.]]]
 => ([(0,4),(1,3),(2,3),(2,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,4),(2,3),(3,4)],5)
 => 1
[.,[[.,[.,[.,.]]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[[.,[[.,.],.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[[[.,.],[.,.]],.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[.,[[[.,[.,.]],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[.,[[[[.,.],.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[.,[.,[.,.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[.,[[.,.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[[.,.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[[.,.],[[.,[.,.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,.],[[[.,.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[.,.]],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[.,.]],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[.,.],.],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[.,.],.],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[.,[.,.]]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[.,[[.,.],.]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[.,.],[.,.]],[.,.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 1
[[[.,[.,.]],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
[[[[.,.],.],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
Description
The arboricity of a graph. This is the minimum number of forests that covers all edges of the graph.
Matching statistic: St000097
(load all 6 compositions to match this statistic)
Mapping
Mp00011: Binary trees —to graph⟶ Graphs
St000097: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[.,.]
 => ([],1)
 => 1 = 0 + 1
[.,[.,.]]
 => ([(0,1)],2)
 => 2 = 1 + 1
[[.,.],.]
 => ([(0,1)],2)
 => 2 = 1 + 1
[.,[.,[.,.]]]
 => ([(0,2),(1,2)],3)
 => 2 = 1 + 1
[.,[[.,.],.]]
 => ([(0,2),(1,2)],3)
 => 2 = 1 + 1
[[.,.],[.,.]]
 => ([(0,2),(1,2)],3)
 => 2 = 1 + 1
[[.,[.,.]],.]
 => ([(0,2),(1,2)],3)
 => 2 = 1 + 1
[[[.,.],.],.]
 => ([(0,2),(1,2)],3)
 => 2 = 1 + 1
[.,[.,[.,[.,.]]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[.,[.,[[.,.],.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[.,[[.,.],[.,.]]]
 => ([(0,3),(1,3),(2,3)],4)
 => 2 = 1 + 1
[.,[[.,[.,.]],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[.,[[[.,.],.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[[.,.],[.,[.,.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[[.,.],[[.,.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[[.,[.,.]],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[[[.,.],.],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[[.,[.,[.,.]]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[[.,[[.,.],.]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[[[.,.],[.,.]],.]
 => ([(0,3),(1,3),(2,3)],4)
 => 2 = 1 + 1
[[[.,[.,.]],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[[[[.,.],.],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[.,[.,[.,[.,[.,.]]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[.,[.,[.,[[.,.],.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[.,[.,[[.,.],[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 2 = 1 + 1
[.,[.,[[.,[.,.]],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[.,[.,[[[.,.],.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[.,[[.,.],[.,[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 2 = 1 + 1
[.,[[.,.],[[.,.],.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 2 = 1 + 1
[.,[[.,[.,.]],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 2 = 1 + 1
[.,[[[.,.],.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 2 = 1 + 1
[.,[[.,[.,[.,.]]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[.,[[.,[[.,.],.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[.,[[[.,.],[.,.]],.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 2 = 1 + 1
[.,[[[.,[.,.]],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[.,[[[[.,.],.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[.,.],[.,[.,[.,.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[.,.],[.,[[.,.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[.,.],[[.,.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 2 = 1 + 1
[[.,.],[[.,[.,.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[.,.],[[[.,.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[.,[.,.]],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[.,[.,.]],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[[.,.],.],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[[.,.],.],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[.,[.,[.,.]]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[.,[[.,.],.]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[[.,.],[.,.]],[.,.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 2 = 1 + 1
[[[.,[.,.]],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[[[.,.],.],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
Description
The order of the largest clique of the graph. A clique in a graph $G$ is a subset $U \subseteq V(G)$ such that any pair of vertices in $U$ are adjacent. I.e. the subgraph induced by $U$ is a complete graph.
Matching statistic: St000098
(load all 6 compositions to match this statistic)
Mapping
Mp00011: Binary trees —to graph⟶ Graphs
St000098: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[.,.]
 => ([],1)
 => 1 = 0 + 1
[.,[.,.]]
 => ([(0,1)],2)
 => 2 = 1 + 1
[[.,.],.]
 => ([(0,1)],2)
 => 2 = 1 + 1
[.,[.,[.,.]]]
 => ([(0,2),(1,2)],3)
 => 2 = 1 + 1
[.,[[.,.],.]]
 => ([(0,2),(1,2)],3)
 => 2 = 1 + 1
[[.,.],[.,.]]
 => ([(0,2),(1,2)],3)
 => 2 = 1 + 1
[[.,[.,.]],.]
 => ([(0,2),(1,2)],3)
 => 2 = 1 + 1
[[[.,.],.],.]
 => ([(0,2),(1,2)],3)
 => 2 = 1 + 1
[.,[.,[.,[.,.]]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[.,[.,[[.,.],.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[.,[[.,.],[.,.]]]
 => ([(0,3),(1,3),(2,3)],4)
 => 2 = 1 + 1
[.,[[.,[.,.]],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[.,[[[.,.],.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[[.,.],[.,[.,.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[[.,.],[[.,.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[[.,[.,.]],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[[[.,.],.],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[[.,[.,[.,.]]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[[.,[[.,.],.]],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[[[.,.],[.,.]],.]
 => ([(0,3),(1,3),(2,3)],4)
 => 2 = 1 + 1
[[[.,[.,.]],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[[[[.,.],.],.],.]
 => ([(0,3),(1,2),(2,3)],4)
 => 2 = 1 + 1
[.,[.,[.,[.,[.,.]]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[.,[.,[.,[[.,.],.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[.,[.,[[.,.],[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 2 = 1 + 1
[.,[.,[[.,[.,.]],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[.,[.,[[[.,.],.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[.,[[.,.],[.,[.,.]]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 2 = 1 + 1
[.,[[.,.],[[.,.],.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 2 = 1 + 1
[.,[[.,[.,.]],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 2 = 1 + 1
[.,[[[.,.],.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 2 = 1 + 1
[.,[[.,[.,[.,.]]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[.,[[.,[[.,.],.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[.,[[[.,.],[.,.]],.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 2 = 1 + 1
[.,[[[.,[.,.]],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[.,[[[[.,.],.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[.,.],[.,[.,[.,.]]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[.,.],[.,[[.,.],.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[.,.],[[.,.],[.,.]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 2 = 1 + 1
[[.,.],[[.,[.,.]],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[.,.],[[[.,.],.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[.,[.,.]],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[.,[.,.]],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[[.,.],.],[.,[.,.]]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[[.,.],.],[[.,.],.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[.,[.,[.,.]]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[.,[[.,.],.]],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[[.,.],[.,.]],[.,.]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 2 = 1 + 1
[[[.,[.,.]],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
[[[[.,.],.],.],[.,.]]
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 2 = 1 + 1
Description
The chromatic number of a graph. The minimal number of colors needed to color the vertices of the graph such that no two vertices which share an edge have the same color.
The following 450 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001029The size of the core of a graph. St001109The number of proper colourings of a graph with as few colours as possible. St001316The domatic number of a graph. St001330The hat guessing number of a graph. St001494The Alon-Tarsi number of a graph. St001580The acyclic chromatic number of a graph. St000846The maximal number of elements covering an element of a poset. St001333The cardinality of a minimal edge-isolating set of a graph. St001335The cardinality of a minimal cycle-isolating set of a graph. St001395The number of strictly unfriendly partitions of a graph. St001777The number of weak descents in an integer composition. St001826The maximal number of leaves on a vertex of a graph. St001931The weak major index of an integer composition regarded as a word. St000093The cardinality of a maximal independent set of vertices of a graph. St000258The burning number of a graph. St000273The domination number of a graph. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St001322The size of a minimal independent dominating set in a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001829The common independence number of a graph. St000183The side length of the Durfee square of an integer partition. St000256The number of parts from which one can substract 2 and still get an integer partition. St000260The radius of a connected graph. St000362The size of a minimal vertex cover of a graph. St000387The matching number of a graph. St000409The number of pitchforks in a binary tree. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000480The number of lower covers of a partition in dominance order. St000481The number of upper covers of a partition in dominance order. St000536The pathwidth of a graph. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001280The number of parts of an integer partition that are at least two. St001349The number of different graphs obtained from the given graph by removing an edge. St001354The number of series nodes in the modular decomposition of a graph. St001393The induced matching number of a graph. St001971The number of negative eigenvalues of the adjacency matrix of the graph. St000010The length of the partition. St000025The number of initial rises of a Dyck path. St000172The Grundy number of a graph. St000288The number of ones in a binary word. St000346The number of coarsenings of a partition. St000378The diagonal inversion number of an integer partition. St000381The largest part of an integer composition. St000382The first part of an integer composition. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000765The number of weak records in an integer composition. St000808The number of up steps of the associated bargraph. St000918The 2-limited packing number of a graph. St001116The game chromatic number of a graph. St001261The Castelnuovo-Mumford regularity of a graph. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001486The number of corners of the ribbon associated with an integer composition. St001581The achromatic number of a graph. St001654The monophonic hull number of a graph. St001670The connected partition number of a graph. St001672The restrained domination number of a graph. St001720The minimal length of a chain of small intervals in a lattice. St001884The number of borders of a binary word. St001963The tree-depth of a graph. St000439The position of the first down step of a Dyck path. St000456The monochromatic index of a connected graph. St001592The maximal number of simple paths between any two different vertices of a graph. St000379The number of Hamiltonian cycles in a graph. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St000255The number of reduced Kogan faces with the permutation as type. St000287The number of connected components of a graph. St000544The cop number of a graph. St000775The multiplicity of the largest eigenvalue in a graph. St000847The number of standard Young tableaux whose descent set is the binary word. St000993The multiplicity of the largest part of an integer partition. St001363The Euler characteristic of a graph according to Knill. St001476The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,-1). St001496The number of graphs with the same Laplacian spectrum as the given graph. St001518The number of graphs with the same ordinary spectrum as the given graph. St001722The number of minimal chains with small intervals between a binary word and the top element. St000290The major index of a binary word. St000291The number of descents of a binary word. St000293The number of inversions of a binary word. St000322The skewness of a graph. St000323The minimal crossing number of a graph. St000347The inversion sum of a binary word. St000358The number of occurrences of the pattern 31-2. St000370The genus of a graph. St000403The Szeged index minus the Wiener index of a graph. St000407The number of occurrences of the pattern 2143 in a permutation. St000559The number of occurrences of the pattern {{1,3},{2,4}} in a set partition. St000563The number of overlapping pairs of blocks of a set partition. St000590The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, 1 is maximal, (2,3) are consecutive in a block. St000629The defect of a binary word. St000699The toughness times the least common multiple of 1,. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000921The number of internal inversions of a binary word. St000929The constant term of the character polynomial of an integer partition. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001059Number of occurrences of the patterns 41352,42351,51342,52341 in a permutation. St001107The number of times one can erase the first up and the last down step in a Dyck path and still remain a Dyck path. St001281The normalized isoperimetric number of a graph. St001305The number of induced cycles on four vertices in a graph. St001307The number of induced stars on four vertices in a graph. St001309The number of four-cliques in a graph. St001310The number of induced diamond graphs in a graph. St001324The minimal number of occurrences of the chordal-pattern in a linear ordering of the vertices of the graph. St001329The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph. St001334The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001485The modular major index of a binary word. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St001578The minimal number of edges to add or remove to make a graph a line graph. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001766The number of cells which are not occupied by the same tile in all reduced pipe dreams corresponding to a permutation. St001793The difference between the clique number and the chromatic number of a graph. St001847The number of occurrences of the pattern 1432 in a permutation. St001871The number of triconnected components of a graph. St000054The first entry of the permutation. St000284The Plancherel distribution on integer partitions. St000286The number of connected components of the complement of a graph. St000326The position of the first one in a binary word after appending a 1 at the end. St000487The length of the shortest cycle of a permutation. St000501The size of the first part in the decomposition of a permutation. St000504The cardinality of the first block of a set partition. St000542The number of left-to-right-minima of a permutation. St000678The number of up steps after the last double rise of a Dyck path. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000706The product of the factorials of the multiplicities of an integer partition. St000735The last entry on the main diagonal of a standard tableau. St000762The sum of the positions of the weak records of an integer composition. St000781The number of proper colouring schemes of a Ferrers diagram. St000805The number of peaks of the associated bargraph. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000823The number of unsplittable factors of the set partition. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000905The number of different multiplicities of parts of an integer composition. St000990The first ascent of a permutation. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001075The minimal size of a block of a set partition. St001128The exponens consonantiae of a partition. St001162The minimum jump of a permutation. St001313The number of Dyck paths above the lattice path given by a binary word. St001344The neighbouring number of a permutation. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001468The smallest fixpoint of a permutation. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001498The normalised height of a Nakayama algebra with magnitude 1. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001568The smallest positive integer that does not appear twice in the partition. St001732The number of peaks visible from the left. St001776The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph. St000065The number of entries equal to -1 in an alternating sign matrix. St000119The number of occurrences of the pattern 321 in a permutation. St000122The number of occurrences of the contiguous pattern [.,[.,[[.,.],.]]] in a binary tree. St000125The number of occurrences of the contiguous pattern [.,[[[.,.],.],. St000127The number of occurrences of the contiguous pattern [.,[.,[.,[[.,.],.]]]] in a binary tree. St000128The number of occurrences of the contiguous pattern [.,[.,[[.,[.,.]],.]]] in a binary tree. St000129The number of occurrences of the contiguous pattern [.,[.,[[[.,.],.],.]]] in a binary tree. St000130The number of occurrences of the contiguous pattern [.,[[.,.],[[.,.],.]]] in a binary tree. St000131The number of occurrences of the contiguous pattern [.,[[[[.,.],.],.],. St000132The number of occurrences of the contiguous pattern [[.,.],[.,[[.,.],.]]] in a binary tree. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000210Minimum over maximum difference of elements in cycles. St000292The number of ascents of a binary word. St000297The number of leading ones in a binary word. St000317The cycle descent number of a permutation. St000348The non-inversion sum of a binary word. St000352The Elizalde-Pak rank of a permutation. St000355The number of occurrences of the pattern 21-3. St000357The number of occurrences of the pattern 12-3. St000360The number of occurrences of the pattern 32-1. St000365The number of double ascents of a permutation. St000367The number of simsun double descents of a permutation. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St000376The bounce deficit of a Dyck path. St000406The number of occurrences of the pattern 3241 in a permutation. St000447The number of pairs of vertices of a graph with distance 3. St000449The number of pairs of vertices of a graph with distance 4. St000478Another weight of a partition according to Alladi. St000491The number of inversions of a set partition. St000497The lcb statistic of a set partition. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000555The number of occurrences of the pattern {{1,3},{2}} in a set partition. St000560The number of occurrences of the pattern {{1,2},{3,4}} in a set partition. St000561The number of occurrences of the pattern {{1,2,3}} in a set partition. St000562The number of internal points of a set partition. St000565The major index of a set partition. St000567The sum of the products of all pairs of parts. St000572The dimension exponent of a set partition. St000581The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 2 is maximal. St000582The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000585The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal, (1,3) are consecutive in a block. St000589The number of occurrences of the pattern {{1},{2,3}} such that 1 is maximal, (2,3) are consecutive in a block. St000594The number of occurrences of the pattern {{1,3},{2}} such that 1,2 are minimal, (1,3) are consecutive in a block. St000600The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, (1,3) are consecutive in a block. St000602The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal. St000606The number of occurrences of the pattern {{1},{2,3}} such that 1,3 are maximal, (2,3) are consecutive in a block. St000610The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal. St000611The number of occurrences of the pattern {{1},{2,3}} such that 1 is maximal. St000613The number of occurrences of the pattern {{1,3},{2}} such that 2 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000623The number of occurrences of the pattern 52341 in a permutation. St000661The number of rises of length 3 of a Dyck path. St000664The number of right ropes of a permutation. St000666The number of right tethers of a permutation. St000674The number of hills of a Dyck path. St000682The Grundy value of Welter's game on a binary word. St000687The dimension of $Hom(I,P)$ for the LNakayama algebra of a Dyck path. St000748The major index of the permutation obtained by flattening the set partition. St000768The number of peaks in an integer composition. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St000799The number of occurrences of the vincular pattern |213 in a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000807The sum of the heights of the valleys of the associated bargraph. St000818The sum of the entries in the column specified by the composition of the change of basis matrix from quasisymmetric Schur functions to monomial quasisymmetric functions. St000842The breadth of a permutation. St000931The number of occurrences of the pattern UUU in a Dyck path. St000936The number of even values of the symmetric group character corresponding to the partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001098The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for vertex labelled trees. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001141The number of occurrences of hills of size 3 in a Dyck path. St001175The size of a partition minus the hook length of the base cell. St001193The dimension of $Ext_A^1(A/AeA,A)$ in the corresponding Nakayama algebra $A$ such that $eA$ is a minimal faithful projective-injective module. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001301The first Betti number of the order complex associated with the poset. St001306The number of induced paths on four vertices in a graph. St001325The minimal number of occurrences of the comparability-pattern in a linear ordering of the vertices of the graph. St001326The minimal number of occurrences of the interval-pattern in a linear ordering of the vertices of the graph. St001371The length of the longest Yamanouchi prefix of a binary word. St001394The genus of a permutation. St001398Number of subsets of size 3 of elements in a poset that form a "v". St001434The number of negative sum pairs of a signed permutation. St001513The number of nested exceedences of a permutation. St001537The number of cyclic crossings of a permutation. St001549The number of restricted non-inversions between exceedances. St001550The number of inversions between exceedances where the greater exceedance is linked. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001577The minimal number of edges to add or remove to make a graph a cograph. St001586The number of odd parts smaller than the largest even part in an integer partition. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001651The Frankl number of a lattice. St001657The number of twos in an integer partition. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St001715The number of non-records in a permutation. St001728The number of invisible descents of a permutation. St001730The number of times the path corresponding to a binary word crosses the base line. St001797The number of overfull subgraphs of a graph. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St001970The signature of a graph. St000806The semiperimeter of the associated bargraph. St000570The Edelman-Greene number of a permutation. St000622The number of occurrences of the patterns 2143 or 4231 in a permutation. St000709The number of occurrences of 14-2-3 or 14-3-2. St000732The number of double deficiencies of a permutation. St000750The number of occurrences of the pattern 4213 in a permutation. St000803The number of occurrences of the vincular pattern |132 in a permutation. St000264The girth of a graph, which is not a tree. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St000486The number of cycles of length at least 3 of a permutation. St000516The number of stretching pairs of a permutation. St000751The number of occurrences of either of the pattern 2143 or 2143 in a permutation. St000779The tier of a permutation. St000804The number of occurrences of the vincular pattern |123 in a permutation. St001082The number of boxed occurrences of 123 in a permutation. St001130The number of two successive successions in a permutation. St001552The number of inversions between excedances and fixed points of a permutation. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000618The number of self-evacuating tableaux of given shape. St000667The greatest common divisor of the parts of the partition. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001389The number of partitions of the same length below the given integer partition. St001432The order dimension of the partition. St001571The Cartan determinant of the integer partition. St001780The order of promotion on the set of standard tableaux of given shape. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001924The number of cells in an integer partition whose arm and leg length coincide. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000219The number of occurrences of the pattern 231 in a permutation. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001613The binary logarithm of the size of the center of a lattice. St000636The hull number of a graph. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St000879The number of long braid edges in the graph of braid moves of a permutation. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000668The least common multiple of the parts of the partition. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000770The major index of an integer partition when read from bottom to top. St000815The number of semistandard Young tableaux of partition weight of given shape. St000933The number of multipartitions of sizes given by an integer partition. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001621The number of atoms of a lattice. St000455The second largest eigenvalue of a graph if it is integral. St000298The order dimension or Dushnik-Miller dimension of a poset. St000717The number of ordinal summands of a poset. 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. St000886The number of permutations with the same antidiagonal sums. St000432The number of occurrences of the pattern 231 or of the pattern 312 in a permutation. St000872The number of very big descents of a permutation. St000962The 3-shifted major index of a permutation. St000963The 2-shifted major index of a permutation. St000436The number of occurrences of the pattern 231 or of the pattern 321 in a permutation. St000710The number of big deficiencies of a permutation. St001340The cardinality of a minimal non-edge isolating set of a graph. St001642The Prague dimension of a graph. St000640The rank of the largest boolean interval in a poset. St000353The number of inner valleys of a permutation. St000434The number of occurrences of the pattern 213 or of the pattern 312 in a permutation. St000726The normalized sum of the leaf labels of the increasing binary tree associated to a permutation. St000866The number of admissible inversions of a permutation in the sense of Shareshian-Wachs. St000914The sum of the values of the Möbius function of a poset. St001933The largest multiplicity of a part in an integer partition. St001095The number of non-isomorphic posets with precisely one further covering relation. St000437The number of occurrences of the pattern 312 or of the pattern 321 in a permutation. St000649The number of 3-excedences of a permutation. St000711The number of big exceedences of a permutation. St000961The shifted major index of a permutation. St001890The maximum magnitude of the Möbius function of a poset. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St000624The normalized sum of the minimal distances to a greater element. St001260The permanent of an alternating sign matrix. St001975The corank of the alternating sign matrix. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000310The minimal degree of a vertex of a graph. St000822The Hadwiger number of the graph. St001339The irredundance number of a graph. St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St000374The number of exclusive right-to-left minima of a permutation. St000996The number of exclusive left-to-right maxima of a permutation. St000741The Colin de Verdière graph invariant. St000243The number of cyclic valleys and cyclic peaks of a permutation. St001114The number of odd descents of a permutation. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001331The size of the minimal feedback vertex set. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001111The weak 2-dynamic chromatic number of a graph. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001644The dimension of a graph. St001716The 1-improper chromatic number of a graph. St000271The chromatic index of a graph. St001108The 2-dynamic chromatic number of a graph. St000259The diameter of a connected graph. St000552The number of cut vertices of a graph. St000897The number of different multiplicities of parts of an integer partition. St000988The orbit size of a permutation under Foata's bijection. St001057The Grundy value of the game of creating an independent set in a graph. St001081The number of minimal length factorizations of a permutation into star transpositions. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001512The minimum rank of a graph. St001665The number of pure excedances of a permutation. St001691The number of kings in a graph. St001737The number of descents of type 2 in a permutation. St001812The biclique partition number of a graph. St000299The number of nonisomorphic vertex-induced subtrees. St000452The number of distinct eigenvalues of a graph. St000453The number of distinct Laplacian eigenvalues of a graph. St000646The number of big ascents of a permutation. St000650The number of 3-rises of a permutation. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001093The detour number of a graph. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001315The dissociation number of a graph. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St001674The number of vertices of the largest induced star graph in the graph. 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)$. St001174The Gorenstein dimension of the algebra $A/I$ when $I$ is the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St000061The number of nodes on the left branch of a binary tree. St000647The number of big descents of a permutation. St000654The first descent of a permutation. St000832The number of permutations obtained by reversing blocks of three consecutive numbers. St001859The number of factors of the Stanley symmetric function associated with a permutation. St000279The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations. St000461The rix statistic of a permutation. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. St000862The number of parts of the shifted shape of a permutation. St000873The aix statistic of a permutation. St000989The number of final rises of a permutation. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001429The number of negative entries in a signed permutation. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St001570The minimal number of edges to add to make a graph Hamiltonian. St001811The Castelnuovo-Mumford regularity of a permutation. St000045The number of linear extensions of a binary tree. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St001060The distinguishing index of a graph. St001877Number of indecomposable injective modules with projective dimension 2. St001545The second Elser number of a connected graph. St001771The number of occurrences of the signed pattern 1-2 in a signed permutation. St001870The number of positive entries followed by a negative entry in a signed permutation. St001895The oddness of a signed permutation. St001625The Möbius invariant of a lattice. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St000671The maximin edge-connectivity for choosing a subgraph. St001323The independence gap of a graph. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St000062The length of the longest increasing subsequence of the permutation. St000308The height of the tree associated to a permutation. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001741The largest integer such that all patterns of this size are contained in the permutation. St001119The length of a shortest maximal path in a graph. St001110The 3-dynamic chromatic number of a graph. St000785The number of distinct colouring schemes of a graph. St000916The packing number of a graph. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001739The number of graphs with the same edge polytope as the given graph. St001740The number of graphs with the same symmetric edge polytope as the given graph. St001520The number of strict 3-descents. St001556The number of inversions of the third entry of a permutation. St001557The number of inversions of the second entry of a permutation. St001948The number of augmented double ascents of a permutation. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001875The number of simple modules with projective dimension at most 1. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St000143The largest repeated part of a partition. St001927Sparre Andersen's number of positives of a signed permutation.