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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
More From: Journal of Combinatorial Theory, Series A
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
