A combinatorial derivation of the number of labeled forests
Combinatorics
2007-05-23 v1
Abstract
Lajos Takacs gave a somewhat formidable alternating sum formula for the number of forests of unrooted trees on labeled vertices. Here we use a weight-reversing involution on suitable tree configurations to give a combinatorial derivation of Takacs' formula.
Keywords
Cite
@article{arxiv.math/0311259,
title = {A combinatorial derivation of the number of labeled forests},
author = {David Callan},
journal= {arXiv preprint arXiv:math/0311259},
year = {2007}
}
Comments
3 pages, LaTeX, to appear Journal of Integer Sequences