A combinatorial proof for the circular chromatic number of Kneser graphs
From MaRDI portal
Publication:326473
DOI10.1007/s10878-015-9897-3zbMath1348.05078OpenAlexW2150244786MaRDI QIDQ326473
Xuding Zhu, Daphne Der-Fen Liu
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
Related Items
Strengthening topological colorful results for graphs ⋮ On total and edge coloring some Kneser graphs ⋮ Circular chromatic number of induced subgraphs of Kneser graphs ⋮ Coloring graphs by translates in the circle
Cites Work
- Unnamed Item
- Unnamed Item
- A generalized Kneser conjecture
- Kneser's conjecture, chromatic number, and homotopy
- Local chromatic number, Ky Fan's theorem, and circular colorings
- A constructive proof of Tucker's combinatorial lemma
- A short proof of Kneser's conjecture
- 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
- Graph powers and graph homomorphisms
- 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
- The Chromatic Number of Kneser Hypergraphs
- Equivariant Cohomology and Lower Bounds for Chromatic Numbers
- Multichromatic numbers, star chromatic numbers and Kneser graphs
- A New Short Proof of Kneser's Conjecture
- A topological lower bound for the circular chromatic number of Schrijver graphs
- 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
- Circular chromatic number: A survey
This page was built for publication: A combinatorial proof for the circular chromatic number of Kneser graphs
