English

The Colin de Verdi\`ere number and graphs of polytopes

Combinatorics 2008-07-25 v3 Metric Geometry

Abstract

The Colin de Verdi\`ere number μ(G)\mu(G) of a graph GG is the maximum corank of a Colin de Verdi\`ere matrix for GG (that is, of a Schr\"odinger operator on GG with a single negative eigenvalue). In 2001, Lov\'asz gave a construction that associated to every convex 3-polytope a Colin de Verdi\`ere matrix of corank 3 for its 1-skeleton. We generalize the Lov\'asz construction to higher dimensions by interpreting it as minus the Hessian matrix of the volume of the polar dual. As a corollary, μ(G)d\mu(G) \ge d if GG is the 1-skeleton of a convex dd-polytope. Determination of the signature of the Hessian of the volume is based on the second Minkowski inequality for mixed volumes and on Bol's condition for equality.

Keywords

Cite

@article{arxiv.0704.0349,
  title  = {The Colin de Verdi\`ere number and graphs of polytopes},
  author = {Ivan Izmestiev},
  journal= {arXiv preprint arXiv:0704.0349},
  year   = {2008}
}

Comments

18 pages, 2 figures; reorganized; an estimate of the spectral gap added; the appendix on mixed volumes rewritten