A bijection of plane increasing trees with relaxed binary trees of right height at most one (Q1725684)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A bijection of plane increasing trees with relaxed binary trees of right height at most one |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A bijection of plane increasing trees with relaxed binary trees of right height at most one |
scientific article |
Statements
A bijection of plane increasing trees with relaxed binary trees of right height at most one (English)
0 references
14 February 2019
0 references
bijection
0 references
directed acyclic graphs
0 references
increasing trees
0 references
Fibonacci numbers
0 references
analytic combinatorics
0 references
limit laws
0 references
random generation
0 references
0.7804595828056335
0 references
0.7573486566543579
0 references
0.755023717880249
0 references
0.7498440742492676
0 references
0.7442381978034973
0 references
