A Bijective Proof For Forest Reciprocity Theorem

2009/09/14 by Huang, ShinnYih
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.0909.2508

Abstract

In this paper, we study the graph polynomial that counts spanning rooted forests f_g of a given graph. This polynomial has a remarkable reciprocity property. We give a new bijective proof for this theorem which has Prufer coding as a special case.

Related

• Counting rooted forests in a network
• Increasing spanning forests in graphs and simplicial complexes
• A combinatorial identity with applications to forest graphs
• Counting bi-colored A'Campo forests
• Directed rooted forests in higher dimension