Sharp estimates for spanning trees

Steven Klee, Bhargav Narayanan, Lisa Sauermann

We prove the following sharp estimate for the number of spanning trees of a graph in terms of its vertex-degrees: a simple graph $G$ on $n$ vertices has at most $(1/n^{2}) \prod_{v…