Circular chromatic number of induced subgraphs of Kneser graphs
From MaRDI portal
Publication:4615060
DOI10.26493/1855-3974.1296.5c7zbMath1414.05106arXiv1612.07462OpenAlexW2579996275WikidataQ129391989 ScholiaQ129391989MaRDI QIDQ4615060
Ali Taherkhani, Meysam Alishahi
Publication date: 1 February 2019
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.07462
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A combinatorial proof for the circular chromatic number of Kneser graphs
- On the chromatic number of general Kneser hypergraphs
- The chromatic number of almost stable Kneser hypergraphs
- Kneser's conjecture, chromatic number, and homotopy
- Local chromatic number, Ky Fan's theorem, and circular colorings
- Circular coloring and Mycielski construction
- On the complexity of H-coloring
- A certain combinatorial inequality
- A short proof of Kneser's conjecture
- Circular chromatic number of Kneser graphs
- Altermatic number of categorical product of graphs
- A short proof for Chen's alternative Kneser coloring lemma
- A combinatorical proof of Kneser's conjecture
- Colourful theorems and indices of homomorphism complexes
- Chromatic number via Turán number
- Strengthening topological colorful results for graphs
- A new coloring theorem of Kneser graphs
- Colorful subgraphs in Kneser-like graphs
- A generalization of Tucker's combinatorial lemma with topological applications
- Circular chromatic numbers of some reduced Kneser graphs
- On the complexity of the circular chromatic number
- Multichromatic numbers, star chromatic numbers and Kneser graphs
- A generalization of Gale's lemma
- On the Multichromatic Number of s‐Stable Kneser Graphs
- A topological lower bound for the circular chromatic number of Schrijver graphs
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- 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: Circular chromatic number of induced subgraphs of Kneser graphs
