On the b-chromatic number of Kneser graphs

From MaRDI portal
Publication:968135

DOI10.1016/J.DAM.2009.09.023zbMATH Open1226.05117arXiv0904.3977OpenAlexW2091676640MaRDI QIDQ968135FDOQ968135


Authors: Hossein Hajiabolhassan Edit this on Wikidata


Publication date: 5 May 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: In this note, we prove that for any integer ngeq3 the b-chromatic number of the Kneser graph KG(m,n) is greater than or equal to 2lfloormover2floorchoosen. This gives an affirmative answer to a conjecture of [6].


Full work available at URL: https://arxiv.org/abs/0904.3977




Recommendations




Cites Work


Cited In (18)





This page was built for publication: On the b-chromatic number of Kneser graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968135)