Topological obstructions to graph colorings

DOI10.1090/S1079-6762-03-00112-4zbMath1063.05041arXivmath/0305300OpenAlexW1485574018MaRDI QIDQ4680992

Dmitry N. Kozlov, Eric K. Babson

Publication date: 14 June 2005

Published in: Electronic Research Announcements of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0305300

zbMATH Keywords

cell complexconjecture of Lovász

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (8)

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 ⋮ Complexes of graph homomorphisms ⋮ The neighborhood complex of a random graph ⋮ Collapsing along monotone poset maps ⋮ Simple homotopy types of Hom-complexes, neighborhood complexes, Lovász complexes, and atom crosscut complexes ⋮ A simple proof for folds on both sides in complexes of graph homomorphisms ⋮ WI-posets, graph complexes and \(\mathbb{Z}_2\)-equivalences ⋮ Cobounding odd cycle colorings

Cites Work

• Kneser's conjecture, chromatic number, and homotopy
• Generalized Kneser coloring theorems with combinatorial proofs
• Higher algebraic K-theory: I

This page was built for publication: Topological obstructions to graph colorings