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

Simple item page
dc.creatorSeo, Seunghyun
dc.date2004-09-18
dc.date.accessioned2026-07-07T05:12:17Z
dc.date.available2026-07-07T05:12:17Z
dc.descriptionIn 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.
dc.description9 pages, 3 figures (use PSTricks)
dc.identifierhttps://arxiv.org/abs/math/0409323
dc.identifierhttp://arxiv.org/abs/math/0409323
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/72523
dc.subjectCombinatorics
dc.subject05A15 (Primary); 05C05, 05C30 (Secondary)
dc.titleA combinatorial proof of Postnikov's identity and a generalized enumeration of labeled trees
dc.typetext

Files

Collections

arXiv