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

Source abstract

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 graphs, European J. Combin. 110 (2023) 103677] proved that every $r$-regular graph $G$ with $r\geq 2$ satisfies $F(G) \leq r^{n}$. They further conjectured that for $r \geq 3$, $$F(G)^{1/n} \leq \frac{(r - 1)^{r-1}}{(r^2 - 2r - 1)^{r/2-1}}.$$ In this paper, we resolve this conjecture in the affirmative.