Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs

By June Huh. 2010

237 citations recorded by the source corpus.

The chromatic polynomial of a graph G counts the number 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. We define a sequence of numerical invariants of projective hypersurfaces analogous to the Milnor number of local analytic hypersurfaces. Then we give a characterization of correspondences between projective spaces up to a positive integer multiple which includes the conjecture on the chromatic polynomial as a special case. As a byproduct of our approach, we obtain an analogue of Kouchnirenko's theorem relating the Milnor number with the Newton polytope.

Subfields: Algebra and Number Theory, Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/67ea06d189a6a03df80951e0de2241e16be87994

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

  1. Federico Ardila
  2. June Huh
  3. Graham C. Denham
  4. Karim A. Adiprasito
  5. Paolo Aluffi
  6. Petter Brand'en
  7. Eric Katz
  8. Christopher Eur

In Discrete Mathematics and Combinatorics

  1. Federico Ardila
  2. June Huh
  3. Eric Katz
  4. Petter Brand'en
  5. Graham C. Denham
  6. Karim A. Adiprasito
  7. Paolo Aluffi
  8. Christopher Eur

In Geometry and Topology

  1. June Huh
  2. Federico Ardila
  3. Eric Katz
  4. Graham C. Denham
  5. Karim A. Adiprasito
  6. Paolo Aluffi
  7. Petter Brand'en
  8. Christopher Eur

Citations in the corpus