On the b-chromatic number of Kneser Graphs
| dc.creator | Hajiabolhassan, Hossein | |
| dc.date | 2009-04-25 | |
| dc.date | 2009-05-26 | |
| dc.date.accessioned | 2026-07-07T13:17:43Z | |
| dc.date.available | 2026-07-07T13:17:43Z | |
| dc.description | 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]. | |
| dc.identifier | https://arxiv.org/abs/0904.3977 | |
| dc.identifier | http://arxiv.org/abs/0904.3977 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/231205 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C | |
| dc.title | On the b-chromatic number of Kneser Graphs | |
| dc.type | text |