Tales of Hoffman

Yonatan Bilu

Tales of Hoffman

Combinatorics 2007-05-23 v2

Authors: Yonatan Bilu

Abstract

Hofmman's bound on the chromatic number of a graph states that $\chi \geq 1 - \frac {\lambda_1} {\lambda_n}$ . Here we show that the same bound, or slight modifications of it, hold for several graph parameters related to the chromatic number: the vector coloring number, the $\psi$ -covering number and the $\lambda$ -clustering number.

Keywords

graph coloring

Cite

@article{arxiv.math/0407107,
  title  = {Tales of Hoffman},
  author = {Yonatan Bilu},
  journal= {arXiv preprint arXiv:math/0407107},
  year   = {2007}
}

Comments

short note - 6 pages

Related papers

View all related →