A combinatorial identity with applications to forest graphs

2019/02/09 by Dorlas, Tony C., Rebenko, Alexei L., Savoie, Baptiste
#05A15 #05A19 #05C30 #Combinatorics (math.CO) #FOS: Mathematics #FOS: Physical sciences #Mathematical Physics (math-ph)

paper · doi:10.48550/arxiv.1902.03470

Abstract

We give an elementary proof of an interesting combinatorial identity which is of particular interest in graph theory and its applications. Two applications to enumeration of forests with closed-form expressions are given.

Related

• Combinatorial Identities Using the Matrix Tree Theorem
• A Bijective Proof For Forest Reciprocity Theorem
• The new simplest proof of Ceyley's formula and connections with Kirkwood-Salzburg equations
• A combinatorial proof of Postnikov's identity and a generalized enumeration of labeled trees
• Lewis Carroll and the Red Hot Potato: a graph theoretic approach to a\n linear algebraic identity