A short proof of \(w_{1}^n (\text{Hom}(C_{2r+1}, K_{n+2})) = 0\) for all \(n\) and a graph colouring theorem by Babson and Kozlov
From MaRDI portal
Publication:839909
DOI10.1007/s11856-009-0023-zzbMath1205.05096arXivmath/0507346OpenAlexW1990464011MaRDI QIDQ839909
Publication date: 3 September 2009
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0507346
Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)
Related Items
Stiefel manifolds and coloring the pentagon, Answers to some problems about graph coloring test graphs, Set partition complexes, Topology of Hom complexes and test graphs for bounding chromatic number
Cites Work
- Kneser's conjecture, chromatic number, and homotopy
- Canonical homeomorphisms of posets
- Complexes of graph homomorphisms
- Proof of the Lovász conjecture
- Small models of graph colouring manifolds and the Stiefel manifolds \(\Hom(C_{5},K_n)\)
- Cobounding odd cycle colorings
- Topological obstructions to graph colorings
- Unnamed Item
- Unnamed Item