✦ LIBER ✦
Left ternary trees and non-separable rooted planar maps
✍ Scribed by Alberto Del Lungo; Francesco Del Ristoro; Jean-Guy Penaud
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 205 KB
- Volume
- 233
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper, we illustrate a bijective proof of the enumerative formula regarding non-separable rooted planar maps NS, by means of a class L of certain ternary trees (called left trees). Our ÿrst step consists in determining the left trees' combinatorial enumeration according to the number of their internal nodes. We then establish a bijection between the left trees having n internal nodes and the non-separable rooted planar maps with n + 1 edges. We wish to point out that in the bijection, L and NS have many corresponding parameters to each other.