Graphs with not too many spanning trees

Let G be a class of graphs that is closed under taking topological minors. We derive in this paper some necessary and sufficient conditions for the existence of a polynomial p(n) such that t(G) ≤ p(|E(G)|) for all graphs G in G, where t(G) is the number of spanning trees of G