A sharp upper bound on the number of spanning forests of regular graphs

T. Wu, S. Lu, X. Dong

Let $G$ be a simple graph on $n$ vertices, and let $F(G)$ denote the number of its spanning forests. Bencs and Csikvári [Upper bound for the number of spanning forests of regular g…