A simple upper bound for the number of spanning trees of regular graphs

We obtain an upper bound for the number of spanning trees of regular graphs of degree $k$ which is in a sense asymptotically exact as $k\to\infty$.