On the b-chromatic number of Kneser graphs

doi:10.1016/j.dam.2009.09.023

Discrete Applied Mathematics

Volume 158, Issue 3, 6 February 2010, Pages 232-234

https://doi.org/10.1016/j.dam.2009.09.023 Get rights and content

Under an Elsevier user license

open archive

Abstract

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

Keywords

Chromatic number

b-chromatic number

Cited by (0)

^☆: This paper is partially supported by Shahid Beheshti University.

Discrete Applied Mathematics

NoteOn the b-chromatic number of Kneser graphs☆

Abstract

Keywords

Note
On the b-chromatic number of Kneser graphs☆