Searcharxiv⌕ Search

arXiv subjects

Shuxin Lu

Publications and source records attributed to Shuxin Lu.

1 recordsLinked to original sources

Upper bounds for the number of spanning forests of a graph

Let $G$ be a simple graph on $n$ vertices, and let $F(G)$ denote the number of spanning forests of $G$. Bencs and Csikvári proved that every $r$-regular graph $G$ with $r\ge 2$ satisfies $F(G)\le r^n$. Motivated by this result, they conjectured that if $G$ has minimum degree at least $3$, then $F(G)\leq \prod_{i=1}^n d_i$, where $(d_1, d_2, \dots, d_n)$ is the degree sequence of $G$. In this paper, we prove that graphs with minimum degree at least $n/3$ $(n\geq7)$ satisfy $F(G)\leq \prod_{i=1}^n d_i$. We also construct a counterexample to the conjecture. We therefore further study the enumeration of spanning forests in general graphs, proving an upper bound in terms of the degree sequence and characterizing the extremal graphs attaining this bound. In addition, using the matrix-forest theorem, we obtain an upper bound for the number of spanning forests of a connected graph in terms of its algebraic connectivity, and characterize the extremal graphs attaining this bound.

math.CO↗