A combinatorial proof for the circular chromatic number of Kneser graphs

DOI10.1007/S10878-015-9897-3zbMATH Open1348.05078OpenAlexW2150244786MaRDI QIDQ326473FDOQ326473

Authors: Daphne Der-Fen Liu, Xuding Zhu 

Publication date: 12 October 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9897-3

Recommendations

• A short proof for Chen's alternative Kneser coloring lemma
• A topological proof of Chen's alternative Kneser coloring theorem
• A new coloring theorem of Kneser graphs
• A combinatorical proof of Kneser's conjecture
• Circular chromatic number of Kneser graphs

zbMATH Keywords

chromatic numbercircular chromatic numberKneser graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Graph powers and graph homomorphisms
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
• Kneser's conjecture, chromatic number, and homotopy
• A short proof of Kneser's conjecture
• The Chromatic Number of Kneser Hypergraphs
• Title not available (Why is that?)
• A New Short Proof of Kneser's Conjecture
• Local chromatic number, Ky Fan's theorem, and circular colorings
• Recent developments in circular colouring of graphs
• Circular chromatic number: A survey
• A constructive proof of Tucker's combinatorial lemma
• Circular chromatic number of Kneser graphs
• Generalized Kneser coloring theorems with combinatorial proofs
• A short proof for Chen's alternative Kneser coloring lemma
• A combinatorical proof of Kneser's conjecture
• A new coloring theorem of Kneser graphs
• A constructive proof of Ky Fan's generalization of Tucker's lemma
• A generalization of Tucker's combinatorial lemma with topological applications
• Circular chromatic numbers of some reduced Kneser graphs
• Equivariant Cohomology and Lower Bounds for Chromatic Numbers
• Multichromatic numbers, star chromatic numbers and Kneser graphs
• A topological lower bound for the circular chromatic number of Schrijver graphs
• A generalized Kneser conjecture

Cited In (9)

• Circular chromatic numbers of some reduced Kneser graphs
• On total and edge coloring some Kneser graphs
• Strengthening topological colorful results for graphs
• A topological proof of Chen's alternative Kneser coloring theorem
• Coloring graphs by translates in the circle
• Circular chromatic number of Kneser graphs
• Circular chromatic number of induced subgraphs of Kneser graphs
• A short proof for Chen's alternative Kneser coloring lemma
• Circular colouring and algebraic no-homomorphism theorems

This page was built for publication: A combinatorial proof for the circular chromatic number of Kneser graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326473)