Tales of Hoffman
| dc.creator | Bilu, Yonatan | |
| dc.date | 2004-07-07 | |
| dc.date | 2004-07-29 | |
| dc.date.accessioned | 2026-07-07T05:10:02Z | |
| dc.date.available | 2026-07-07T05:10:02Z | |
| dc.description | Hofmman's bound on the chromatic number of a graph states that $χ\geq 1 - \frac {λ_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. | |
| dc.description | short note - 6 pages | |
| dc.identifier | https://arxiv.org/abs/math/0407107 | |
| dc.identifier | http://arxiv.org/abs/math/0407107 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/71804 | |
| dc.subject | Combinatorics | |
| dc.subject | 05c15; 05c50 | |
| dc.title | Tales of Hoffman | |
| dc.type | text |