A combinatorial derivation of the number of labeled forests

Details A combinatorial derivation of the number of labeled forests A combinatorial derivation of the number of labeled forests

2003-11-16

arxiv.org/abs/math/0311259v1

Mathematics

Combinatorics

3 pages, LaTeX, to appear Journal of Integer Sequences

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A combinatorial derivation of the number of labeled forests does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A combinatorial derivation of the number of labeled forests, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A combinatorial derivation of the number of labeled forests will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-635324