Title of article
Tales of Hoffman: Three extensions of Hoffmanʹs bound on the graph chromatic number
Author/Authors
Bilu، نويسنده , , Yonatan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
6
From page
608
To page
613
Abstract
Hoffmanʹs bound on the chromatic number of a graph states that χ ⩾ 1 − λ 1 / λ 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 ψ-covering number and the λ-clustering number.
Keywords
Graph chromatic number , Vector chromatic number , Hoffmanיs bound , Positive semidefinite matrices , eigenvalues
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2006
Journal title
Journal of Combinatorial Theory Series B
Record number
1527716
Link To Document