A combinatorial derivation of the number of labeled forests

Simple item page
dc.creatorCallan, David
dc.date2003-11-16
dc.date.accessioned2026-07-07T05:02:56Z
dc.date.available2026-07-07T05:02:56Z
dc.descriptionLajos 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.
dc.description3 pages, LaTeX, to appear Journal of Integer Sequences
dc.identifierhttps://arxiv.org/abs/math/0311259
dc.identifierhttp://arxiv.org/abs/math/0311259
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/69213
dc.subjectCombinatorics
dc.subject05C05
dc.titleA combinatorial derivation of the number of labeled forests
dc.typetext

Files

Collections

arXiv