Foata's Bijection for Tree-Like Structures
Combinatorics
2007-05-23 v1
Abstract
We present bijections enumerating (k,m)-trees, k-gon trees, edge labelled (2,1)-trees, and other tree-like structures. Our constructions are based on Foata's (1971) bijection for cycle-free functions, which is simplified here.
Cite
@article{arxiv.math/0007148,
title = {Foata's Bijection for Tree-Like Structures},
author = {Oleg Pikhurko},
journal= {arXiv preprint arXiv:math/0007148},
year = {2007}
}
Comments
8 pages