A short proof for Chen's alternative Kneser coloring lemma
From MaRDI portal
Publication:1758510
DOI10.1016/j.jcta.2012.07.009zbMath1253.05066OpenAlexW324324708WikidataQ124969505 ScholiaQ124969505MaRDI QIDQ1758510
Gerard Jennhwa Chang, Xuding Zhu, Daphne Der-Fen Liu
Publication date: 9 November 2012
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2012.07.009
Related Items (10)
Strengthening topological colorful results for graphs ⋮ A combinatorial proof for the circular chromatic number of Kneser graphs ⋮ Coloring properties of categorical product of general Kneser hypergraphs ⋮ Circular chromatic number of induced subgraphs of Kneser graphs ⋮ On the chromatic number of general Kneser hypergraphs ⋮ Colorful subhypergraphs in uniform hypergraphs ⋮ A new lower bound for the chromatic number of general Kneser hypergraphs ⋮ Coloring graphs by translates in the circle ⋮ On the Chromatic Number of Matching Kneser Graphs ⋮ On the Multichromatic Number of s‐Stable Kneser Graphs
This page was built for publication: A short proof for Chen's alternative Kneser coloring lemma
