A proof of Tomescu's graph coloring conjecture

Jacob Fox, Xiaoyu He, Freddie Manners

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 Moha…