Abstract
We introduce a new method for constructing graphs with high chromatic number and small clique number. Indeed, we present a new proof for the well-known Kneser conjecture via this method.
| Original language | English |
|---|---|
| Pages (from-to) | 238-245 |
| Number of pages | 8 |
| Journal | Discrete and Computational Geometry |
| Volume | 59 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1 Jan 2018 |
| Externally published | Yes |
Keywords
- Borsuk–Ulam theorem
- Chromatic number
- Triangle-free graphs
- Tucker’s lemma
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics