Hadwiger meets Cayley

Jacob W. Cooper, Adam Kabela, Daniel Král' +1

We show that every connected $k$-chromatic graph contains at least $k^{k-2}$ spanning trees.