Highly Influenced

# Bijective Counting of Tree-Rooted Maps and Shuffles of Parenthesis Systems

@article{Bernardi2007BijectiveCO, title={Bijective Counting of Tree-Rooted Maps and Shuffles of Parenthesis Systems}, author={Olivier Bernardi}, journal={Electr. J. Comb.}, year={2007}, volume={14} }

- Published 2007 in Electr. J. Comb.

The number of tree-rooted maps, that is, rooted planar maps with a distinguished spanning tree, of size n is CnCn+1 where Cn = 1 n+1 ( 2n n ) is the nh Catalan number. We present a (long awaited) simple bijection which explains this result. Then, we prove that our bijection is isomorphic to a former recursive construction on shuffles of parenthesis systems due to Cori, Dulucq and Viennot.

Highly Cited

This paper has 54 citations. REVIEW CITATIONS

#### 33 Figures & Tables

#### Topics

#### Statistics

Citations per Year

#### 54 Citations

Semantic Scholar estimates that this publication has

**54**citations based on the available data.See our **FAQ** for additional information.