The Kirchhoff's theorem is a classical result for counting the number of spanning trees in a graph.

However, what are the best known upper bounds on the number of spanning trees in a graph in terms of structural parameters (e.g., number of vertices, degrees, etc.) instead of algebraic quantities?