A new coloring theorem of Kneser graphs

DOI10.1016/j.jcta.2010.08.008zbMath1227.05142OpenAlexW1990568682MaRDI QIDQ2431265

Peng-An Chen

Publication date: 11 April 2011

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.2010.08.008

zbMATH Keywords

circular chromatic numberchromatic numberKneser graphsmatching admissible sequencesoctahedral Fan's Lemma

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (13)

Strengthening topological colorful results for graphs ⋮ A combinatorial proof for the circular chromatic number of Kneser graphs ⋮ Colorings of complements of line graphs ⋮ Coloring properties of categorical product of general Kneser hypergraphs ⋮ Circular chromatic number of induced subgraphs of Kneser graphs ⋮ A generalization of Kneser's conjecture ⋮ 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 a subgraph of the Kneser graph ⋮ On the Chromatic Number of Matching Kneser Graphs ⋮ On the Multichromatic Number of s‐Stable Kneser Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• Local chromatic number, Ky Fan's theorem, and circular colorings
• A certain combinatorial inequality
• Circular chromatic number of Kneser graphs
• Generalized Kneser coloring theorems with combinatorial proofs
• A combinatorical proof of Kneser's conjecture
• Combinatorial Stokes formulae
• A generalization of Tucker's combinatorial lemma with topological applications
• Circular chromatic numbers of some reduced Kneser graphs
• Multichromatic numbers, star chromatic numbers and Kneser graphs
• A topological lower bound for the circular chromatic number of Schrijver graphs
• Simplicial maps from an orientable n-pseudomanifold into Sm with the octahedral triangulation

This page was built for publication: A new coloring theorem of Kneser graphs