Tales of Hoffman

Details Tales of Hoffman Tales of Hoffman

2004-07-07

arxiv.org/abs/math/0407107v2

Mathematics

Combinatorics

short note - 6 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Tales of Hoffman does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tales of Hoffman, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tales of Hoffman will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-729280