Small models of graph colouring manifolds and the Stiefel manifolds \(\Hom(C_{5},K_n)\)
From MaRDI portal
Publication:2469199
DOI10.1016/j.jcta.2007.04.004zbMath1142.05030arXivmath/0510535OpenAlexW2060559477MaRDI QIDQ2469199
Publication date: 4 February 2008
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0510535
Triangulating manifolds (57Q15) Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)
Related Items
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 ⋮ Using equivariant obstruction theory in combinatorial geometry ⋮ Stiefel manifolds and coloring the pentagon ⋮ The equivariant topology of stable Kneser graphs ⋮ Homomorphism complexes, reconfiguration, and homotopy for directed graphs ⋮ Homomorphism complexes and \(k\)-cores ⋮ Graph colorings, spaces of edges and spaces of circuits ⋮ Homomorphism complexes and maximal chains in graded posets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Kneser's conjecture, chromatic number, and homotopy
- Homotopy types of box complexes
- Canonical homeomorphisms of posets
- Topological lower bounds for the chromatic number: a hierarchy
- Box complexes, neighborhood complexes, and the chromatic number
- Complexes of graph homomorphisms
- Proof of the Lovász conjecture
- Classifying spaces and spectral sequences
- WI-posets, graph complexes and \(\mathbb{Z}_2\)-equivalences
- Unknotting combinatorial balls
- A simple proof for folds on both sides in complexes of graph homomorphisms