Title of article
A short proof for Chenʼs Alternative Kneser Coloring Lemma
Author/Authors
Chang، نويسنده , , Gerard Jennhwa and Liu، نويسنده , , Daphne Der-Fen and Zhu، نويسنده , , Xuding، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2013
Pages
5
From page
159
To page
163
Abstract
We give a short proof for Chenʼs Alternative Kneser Coloring Lemma. This leads to a short proof for the Johnson–Holroyd–Stahl conjecture that Kneser graphs have their circular chromatic numbers equal to their chromatic numbers.
Keywords
chromatic number , Kneser graphs , circular chromatic number
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2013
Journal title
Journal of Combinatorial Theory Series A
Record number
1531841
Link To Document