A combinatorial derivation of the number of labeled forests
Abstract
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.