| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4655554 | Journal of Combinatorial Theory, Series A | 2013 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
