Foata's Bijection for Tree-Like Structures

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
8 pages

Keywords

Combinatorics, 05A15

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/59616

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0007148
 http://arxiv.org/abs/math/0007148

Collections

arXiv