On the b-chromatic number of Kneser Graphs
classification
🧮 math.CO
keywords
b-chromaticknesernumberaffirmativeanswerchooseconjectureequal
read the original abstract
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].
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.