Identifier
-
Mp00026:
Dyck paths
—to ordered tree⟶
Ordered trees
Mp00046: Ordered trees —to graph⟶ Graphs
St000272: Graphs ⟶ ℤ
Values
[1,0] => [[]] => ([(0,1)],2) => 1
[1,0,1,0] => [[],[]] => ([(0,2),(1,2)],3) => 1
[1,1,0,0] => [[[]]] => ([(0,2),(1,2)],3) => 1
[1,0,1,0,1,0] => [[],[],[]] => ([(0,3),(1,3),(2,3)],4) => 1
[1,0,1,1,0,0] => [[],[[]]] => ([(0,3),(1,2),(2,3)],4) => 1
[1,1,0,0,1,0] => [[[]],[]] => ([(0,3),(1,2),(2,3)],4) => 1
[1,1,0,1,0,0] => [[[],[]]] => ([(0,3),(1,3),(2,3)],4) => 1
[1,1,1,0,0,0] => [[[[]]]] => ([(0,3),(1,2),(2,3)],4) => 1
[1,0,1,0,1,0,1,0] => [[],[],[],[]] => ([(0,4),(1,4),(2,4),(3,4)],5) => 1
[1,0,1,0,1,1,0,0] => [[],[],[[]]] => ([(0,4),(1,4),(2,3),(3,4)],5) => 1
[1,0,1,1,0,0,1,0] => [[],[[]],[]] => ([(0,4),(1,4),(2,3),(3,4)],5) => 1
[1,0,1,1,0,1,0,0] => [[],[[],[]]] => ([(0,4),(1,4),(2,3),(3,4)],5) => 1
[1,0,1,1,1,0,0,0] => [[],[[[]]]] => ([(0,4),(1,3),(2,3),(2,4)],5) => 1
[1,1,0,0,1,0,1,0] => [[[]],[],[]] => ([(0,4),(1,4),(2,3),(3,4)],5) => 1
[1,1,0,0,1,1,0,0] => [[[]],[[]]] => ([(0,4),(1,3),(2,3),(2,4)],5) => 1
[1,1,0,1,0,0,1,0] => [[[],[]],[]] => ([(0,4),(1,4),(2,3),(3,4)],5) => 1
[1,1,0,1,0,1,0,0] => [[[],[],[]]] => ([(0,4),(1,4),(2,4),(3,4)],5) => 1
[1,1,0,1,1,0,0,0] => [[[],[[]]]] => ([(0,4),(1,4),(2,3),(3,4)],5) => 1
[1,1,1,0,0,0,1,0] => [[[[]]],[]] => ([(0,4),(1,3),(2,3),(2,4)],5) => 1
[1,1,1,0,0,1,0,0] => [[[[]],[]]] => ([(0,4),(1,4),(2,3),(3,4)],5) => 1
[1,1,1,0,1,0,0,0] => [[[[],[]]]] => ([(0,4),(1,4),(2,3),(3,4)],5) => 1
[1,1,1,1,0,0,0,0] => [[[[[]]]]] => ([(0,4),(1,3),(2,3),(2,4)],5) => 1
[1,0,1,0,1,0,1,0,1,0] => [[],[],[],[],[]] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => 1
[1,0,1,0,1,0,1,1,0,0] => [[],[],[],[[]]] => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6) => 1
[1,0,1,0,1,1,0,0,1,0] => [[],[],[[]],[]] => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6) => 1
[1,0,1,0,1,1,0,1,0,0] => [[],[],[[],[]]] => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6) => 1
[1,0,1,0,1,1,1,0,0,0] => [[],[],[[[]]]] => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6) => 1
[1,0,1,1,0,0,1,0,1,0] => [[],[[]],[],[]] => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6) => 1
[1,0,1,1,0,0,1,1,0,0] => [[],[[]],[[]]] => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6) => 1
[1,0,1,1,0,1,0,0,1,0] => [[],[[],[]],[]] => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6) => 1
[1,0,1,1,0,1,0,1,0,0] => [[],[[],[],[]]] => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6) => 1
[1,0,1,1,0,1,1,0,0,0] => [[],[[],[[]]]] => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6) => 1
[1,0,1,1,1,0,0,0,1,0] => [[],[[[]]],[]] => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6) => 1
[1,0,1,1,1,0,0,1,0,0] => [[],[[[]],[]]] => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6) => 1
[1,0,1,1,1,0,1,0,0,0] => [[],[[[],[]]]] => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6) => 1
[1,0,1,1,1,1,0,0,0,0] => [[],[[[[]]]]] => ([(0,5),(1,4),(2,3),(2,4),(3,5)],6) => 1
[1,1,0,0,1,0,1,0,1,0] => [[[]],[],[],[]] => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6) => 1
[1,1,0,0,1,0,1,1,0,0] => [[[]],[],[[]]] => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6) => 1
[1,1,0,0,1,1,0,0,1,0] => [[[]],[[]],[]] => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6) => 1
[1,1,0,0,1,1,0,1,0,0] => [[[]],[[],[]]] => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6) => 1
[1,1,0,0,1,1,1,0,0,0] => [[[]],[[[]]]] => ([(0,5),(1,4),(2,3),(2,4),(3,5)],6) => 1
[1,1,0,1,0,0,1,0,1,0] => [[[],[]],[],[]] => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6) => 1
[1,1,0,1,0,0,1,1,0,0] => [[[],[]],[[]]] => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6) => 1
[1,1,0,1,0,1,0,0,1,0] => [[[],[],[]],[]] => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6) => 1
[1,1,0,1,0,1,0,1,0,0] => [[[],[],[],[]]] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => 1
[1,1,0,1,0,1,1,0,0,0] => [[[],[],[[]]]] => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6) => 1
[1,1,0,1,1,0,0,0,1,0] => [[[],[[]]],[]] => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6) => 1
[1,1,0,1,1,0,0,1,0,0] => [[[],[[]],[]]] => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6) => 1
[1,1,0,1,1,0,1,0,0,0] => [[[],[[],[]]]] => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6) => 1
[1,1,0,1,1,1,0,0,0,0] => [[[],[[[]]]]] => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6) => 1
[1,1,1,0,0,0,1,0,1,0] => [[[[]]],[],[]] => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6) => 1
[1,1,1,0,0,0,1,1,0,0] => [[[[]]],[[]]] => ([(0,5),(1,4),(2,3),(2,4),(3,5)],6) => 1
[1,1,1,0,0,1,0,0,1,0] => [[[[]],[]],[]] => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6) => 1
[1,1,1,0,0,1,0,1,0,0] => [[[[]],[],[]]] => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6) => 1
[1,1,1,0,0,1,1,0,0,0] => [[[[]],[[]]]] => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6) => 1
[1,1,1,0,1,0,0,0,1,0] => [[[[],[]]],[]] => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6) => 1
[1,1,1,0,1,0,0,1,0,0] => [[[[],[]],[]]] => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6) => 1
[1,1,1,0,1,0,1,0,0,0] => [[[[],[],[]]]] => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6) => 1
[1,1,1,0,1,1,0,0,0,0] => [[[[],[[]]]]] => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6) => 1
[1,1,1,1,0,0,0,0,1,0] => [[[[[]]]],[]] => ([(0,5),(1,4),(2,3),(2,4),(3,5)],6) => 1
[1,1,1,1,0,0,0,1,0,0] => [[[[[]]],[]]] => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6) => 1
[1,1,1,1,0,0,1,0,0,0] => [[[[[]],[]]]] => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6) => 1
[1,1,1,1,0,1,0,0,0,0] => [[[[[],[]]]]] => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6) => 1
[1,1,1,1,1,0,0,0,0,0] => [[[[[[]]]]]] => ([(0,5),(1,4),(2,3),(2,4),(3,5)],6) => 1
[1,0,1,0,1,0,1,0,1,0,1,0] => [[],[],[],[],[],[]] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7) => 1
[1,0,1,0,1,0,1,0,1,1,0,0] => [[],[],[],[],[[]]] => ([(0,6),(1,6),(2,6),(3,6),(4,5),(5,6)],7) => 1
[1,0,1,0,1,0,1,1,0,0,1,0] => [[],[],[],[[]],[]] => ([(0,6),(1,6),(2,6),(3,6),(4,5),(5,6)],7) => 1
[1,0,1,0,1,0,1,1,0,1,0,0] => [[],[],[],[[],[]]] => ([(0,6),(1,6),(2,6),(3,5),(4,5),(5,6)],7) => 1
[1,0,1,0,1,0,1,1,1,0,0,0] => [[],[],[],[[[]]]] => ([(0,6),(1,6),(2,6),(3,4),(4,5),(5,6)],7) => 1
[1,0,1,0,1,1,0,0,1,0,1,0] => [[],[],[[]],[],[]] => ([(0,6),(1,6),(2,6),(3,6),(4,5),(5,6)],7) => 1
[1,0,1,0,1,1,0,0,1,1,0,0] => [[],[],[[]],[[]]] => ([(0,6),(1,6),(2,5),(3,4),(4,6),(5,6)],7) => 1
[1,0,1,0,1,1,0,1,0,0,1,0] => [[],[],[[],[]],[]] => ([(0,6),(1,6),(2,6),(3,5),(4,5),(5,6)],7) => 1
[1,0,1,0,1,1,0,1,0,1,0,0] => [[],[],[[],[],[]]] => ([(0,6),(1,6),(2,6),(3,5),(4,5),(5,6)],7) => 1
[1,0,1,0,1,1,0,1,1,0,0,0] => [[],[],[[],[[]]]] => ([(0,6),(1,5),(2,5),(3,4),(4,6),(5,6)],7) => 1
[1,0,1,0,1,1,1,0,0,0,1,0] => [[],[],[[[]]],[]] => ([(0,6),(1,6),(2,6),(3,4),(4,5),(5,6)],7) => 1
[1,0,1,0,1,1,1,0,0,1,0,0] => [[],[],[[[]],[]]] => ([(0,6),(1,5),(2,5),(3,4),(4,6),(5,6)],7) => 1
[1,0,1,0,1,1,1,0,1,0,0,0] => [[],[],[[[],[]]]] => ([(0,6),(1,6),(2,5),(3,5),(4,5),(4,6)],7) => 1
[1,0,1,0,1,1,1,1,0,0,0,0] => [[],[],[[[[]]]]] => ([(0,6),(1,6),(2,3),(3,5),(4,5),(4,6)],7) => 1
[1,0,1,1,0,0,1,0,1,0,1,0] => [[],[[]],[],[],[]] => ([(0,6),(1,6),(2,6),(3,6),(4,5),(5,6)],7) => 1
[1,0,1,1,0,0,1,0,1,1,0,0] => [[],[[]],[],[[]]] => ([(0,6),(1,6),(2,5),(3,4),(4,6),(5,6)],7) => 1
[1,0,1,1,0,0,1,1,0,0,1,0] => [[],[[]],[[]],[]] => ([(0,6),(1,6),(2,5),(3,4),(4,6),(5,6)],7) => 1
[1,0,1,1,0,0,1,1,0,1,0,0] => [[],[[]],[[],[]]] => ([(0,6),(1,5),(2,5),(3,4),(4,6),(5,6)],7) => 1
[1,0,1,1,0,0,1,1,1,0,0,0] => [[],[[]],[[[]]]] => ([(0,6),(1,4),(2,3),(3,6),(4,5),(5,6)],7) => 1
[1,0,1,1,0,1,0,0,1,0,1,0] => [[],[[],[]],[],[]] => ([(0,6),(1,6),(2,6),(3,5),(4,5),(5,6)],7) => 1
[1,0,1,1,0,1,0,0,1,1,0,0] => [[],[[],[]],[[]]] => ([(0,6),(1,5),(2,5),(3,4),(4,6),(5,6)],7) => 1
[1,0,1,1,0,1,0,1,0,0,1,0] => [[],[[],[],[]],[]] => ([(0,6),(1,6),(2,6),(3,5),(4,5),(5,6)],7) => 1
[1,0,1,1,0,1,0,1,0,1,0,0] => [[],[[],[],[],[]]] => ([(0,6),(1,6),(2,6),(3,6),(4,5),(5,6)],7) => 1
[1,0,1,1,0,1,0,1,1,0,0,0] => [[],[[],[],[[]]]] => ([(0,6),(1,6),(2,5),(3,4),(4,6),(5,6)],7) => 1
[1,0,1,1,0,1,1,0,0,0,1,0] => [[],[[],[[]]],[]] => ([(0,6),(1,5),(2,5),(3,4),(4,6),(5,6)],7) => 1
[1,0,1,1,0,1,1,0,0,1,0,0] => [[],[[],[[]],[]]] => ([(0,6),(1,6),(2,5),(3,4),(4,6),(5,6)],7) => 1
[1,0,1,1,0,1,1,0,1,0,0,0] => [[],[[],[[],[]]]] => ([(0,6),(1,5),(2,5),(3,4),(4,6),(5,6)],7) => 1
[1,0,1,1,0,1,1,1,0,0,0,0] => [[],[[],[[[]]]]] => ([(0,6),(1,4),(2,3),(3,6),(4,5),(5,6)],7) => 1
[1,0,1,1,1,0,0,0,1,0,1,0] => [[],[[[]]],[],[]] => ([(0,6),(1,6),(2,6),(3,4),(4,5),(5,6)],7) => 1
[1,0,1,1,1,0,0,0,1,1,0,0] => [[],[[[]]],[[]]] => ([(0,6),(1,4),(2,3),(3,6),(4,5),(5,6)],7) => 1
[1,0,1,1,1,0,0,1,0,0,1,0] => [[],[[[]],[]],[]] => ([(0,6),(1,5),(2,5),(3,4),(4,6),(5,6)],7) => 1
[1,0,1,1,1,0,0,1,0,1,0,0] => [[],[[[]],[],[]]] => ([(0,6),(1,6),(2,5),(3,4),(4,6),(5,6)],7) => 1
[1,0,1,1,1,0,0,1,1,0,0,0] => [[],[[[]],[[]]]] => ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7) => 1
[1,0,1,1,1,0,1,0,0,0,1,0] => [[],[[[],[]]],[]] => ([(0,6),(1,6),(2,5),(3,5),(4,5),(4,6)],7) => 1
[1,0,1,1,1,0,1,0,0,1,0,0] => [[],[[[],[]],[]]] => ([(0,6),(1,5),(2,5),(3,4),(4,6),(5,6)],7) => 1
[1,0,1,1,1,0,1,0,1,0,0,0] => [[],[[[],[],[]]]] => ([(0,6),(1,6),(2,6),(3,4),(4,5),(5,6)],7) => 1
[1,0,1,1,1,0,1,1,0,0,0,0] => [[],[[[],[[]]]]] => ([(0,6),(1,4),(2,3),(3,6),(4,5),(5,6)],7) => 1
>>> Load all 197 entries. <<<
search for individual values
searching the database for the individual values of this statistic
/
search for generating function
searching the database for statistics with the same generating function
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.
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.
Map
to ordered tree
Description
Sends a Dyck path to the ordered tree encoding the heights of the path.
This map is recursively defined as follows: A Dyck path $D$ of semilength $n$ may be decomposed, according to its returns (St000011The number of touch points (or returns) of a Dyck path.), into smaller paths $D_1,\dots,D_k$ of respective semilengths $n_1,\dots,n_k$ (so one has $n = n_1 + \dots n_k$) each of which has no returns.
Denote by $\tilde D_i$ the path of semilength $n_i-1$ obtained from $D_i$ by removing the initial up- and the final down-step.
This map then sends $D$ to the tree $T$ having a root note with ordered children $T_1,\dots,T_k$ which are again ordered trees computed from $D_1,\dots,D_k$ respectively.
The unique path of semilength $1$ is sent to the tree consisting of a single node.
This map is recursively defined as follows: A Dyck path $D$ of semilength $n$ may be decomposed, according to its returns (St000011The number of touch points (or returns) of a Dyck path.), into smaller paths $D_1,\dots,D_k$ of respective semilengths $n_1,\dots,n_k$ (so one has $n = n_1 + \dots n_k$) each of which has no returns.
Denote by $\tilde D_i$ the path of semilength $n_i-1$ obtained from $D_i$ by removing the initial up- and the final down-step.
This map then sends $D$ to the tree $T$ having a root note with ordered children $T_1,\dots,T_k$ which are again ordered trees computed from $D_1,\dots,D_k$ respectively.
The unique path of semilength $1$ is sent to the tree consisting of a single node.
Map
to graph
Description
Return the undirected graph obtained from the tree nodes and edges.
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!