Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs

Abstract

The chromatic polynomial χG(q) of a graph G counts the num- ber of proper colorings of G. We give an affirmative answer to the conjecture of Read and Rota-Heron-Welsh that the absolute values of the coefficients of the chromatic polynomial form a log-concave sequence. The proof is obtained by identifying χG(q) with a sequence of numerical invariants of a projective hypersurface analogous to the Milnor number of a local analytic hypersurface. As a by-product of our approach, we obtain an analogue of Kouchnirenko’s