On the b-chromatic number of Kneser Graphs

Abstract

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