On the b-chromatic number of Kneser Graphs

Details On the b-chromatic number of Kneser Graphs On the b-chromatic number of Kneser Graphs

2009-04-25

arxiv.org/abs/0904.3977v4

Mathematics

Combinatorics

Scientific paper

In this note, we prove that for any integer $n\geq 3$ the b-chromatic number
of the Kneser graph $KG(m,n)$ is greater than or equal to $2{\lfloor {m\over 2}
\rfloor \choose n}$. This gives an affirmative answer to a conjecture of [6].

Affiliated with

Also associated with

No associations

Rating

On the b-chromatic number of Kneser Graphs 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 On the b-chromatic number of Kneser Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the b-chromatic number of Kneser Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-671339