A proof of Tomescu's graph coloring conjecture

Abstract

In 1971, Tomescu conjectured that every connected graph $G$ on $n$ vertices with chromatic number $k\ge 4$ has at most $k!(k-1{)}^{n-k}$ proper $k$-colorings. Recently, Knox and Mohar proved Tomescu's conjecture for $k=4$ and $k=5$. In this paper, we complete the proof of Tomescu's conjecture for all $k\ge 4$, and show that equality occurs if and only if $G$ is a $k$-clique with trees attached to each vertex.

Adds a short proof of the case k=4, removing dependence on previous work