A combinatorial proof of Postnikov's identity and a generalized enumeration of labeled trees

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In this paper, we give a simple combinatorial explanation of a formula of A. Postnikov relating bicolored rooted trees to bicolored binary trees. We also present generalized formulas for the number of labeled k-ary trees, rooted labeled trees, and labeled plane trees.
9 pages, 3 figures (use PSTricks)

Keywords

Combinatorics, 05A15 (Primary); 05C05, 05C30 (Secondary)

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

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

Collections

arXiv