A combinatorial derivation of the number of labeled forests

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Lajos Takacs gave a somewhat formidable alternating sum formula for the number of forests of unrooted trees on $n$ labeled vertices. Here we use a weight-reversing involution on suitable tree configurations to give a combinatorial derivation of Takacs' formula.
3 pages, LaTeX, to appear Journal of Integer Sequences

Keywords

Combinatorics, 05C05

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

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

Collections

arXiv