Dear All,

The Kirchhoff's theorem counts spanning trees. OK. 


I have some quick questions:

1) What are the best known upper bounds on the number of spanning trees in a graph?

2) I did not find much information about lower bounds. Is it because the problem is trivial, or simply not interesting? I do not know why it is trivial, in case, but this is my naive answer. 

Thanks a lot...