A topological lower bound for the circular chromatic number of Schrijver graphs

DOI10.1002/jgt.20079zbMath1068.05025OpenAlexW4231010082MaRDI QIDQ5311915

Frédéric Meunier

Publication date: 29 August 2005

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20079

zbMATH Keywords

topological methodsKneser graphsFan's theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Strengthening topological colorful results for graphs ⋮ A combinatorial proof for the circular chromatic number of Kneser graphs ⋮ Colorful subhypergraphs in Kneser hypergraphs ⋮ A new coloring theorem of Kneser graphs ⋮ Circular chromatic number of induced subgraphs of Kneser graphs ⋮ A generalization of Kneser's conjecture ⋮ On the chromatic number of general Kneser hypergraphs ⋮ Colorful subgraphs in Kneser-like graphs ⋮ Circular coloring and Mycielski construction ⋮ On the chromatic number of a subgraph of the Kneser graph ⋮ On colorings of graph powers ⋮ On the Multichromatic Number of s‐Stable Kneser Graphs

This page was built for publication: A topological lower bound for the circular chromatic number of Schrijver graphs