On the chromatic number of a subgraph of the Kneser graph

DOI10.1016/j.endm.2018.06.039zbMath1397.05067arXiv1803.04342OpenAlexW2963228758MaRDI QIDQ1792105

Bart Sevenster, Bart Litjens, Lluís Vena, Sven C. Polak

Publication date: 11 October 2018

Full work available at URL: https://arxiv.org/abs/1803.04342

zbMATH Keywords

circular chromatic numberpolygonindependence numberchromatic numberKneser graphinterlace

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Edge-critical subgraphs of Schrijver graphs. II: The general case ⋮ On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges

Cites Work

• Unnamed Item
• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• Local chromatic number, Ky Fan's theorem, and circular colorings
• A new coloring theorem of Kneser graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Multichromatic numbers, star chromatic numbers and Kneser graphs
• A topological lower bound for the circular chromatic number of Schrijver graphs
• Circular chromatic number: A survey