  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.
