A short proof of a conjecture on the connectivity of graph coloring complexes

DOI10.1090/S0002-9939-06-08417-6zbMath1140.57004arXivmath/0505460WikidataQ123255729 ScholiaQ123255729MaRDI QIDQ3419958

Alexander Engström

Publication date: 1 February 2007

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

graph homomorphisms\(k\)-connectivityHom-complexesgraph coloring complexes

Mathematics Subject Classification ID

Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Homomorphism complexes, reconfiguration, and homotopy for directed graphs ⋮ Set partition complexes ⋮ Homomorphism complexes and \(k\)-cores ⋮ Complexes of directed trees and independence complexes

Cites Work

• Morse theory for cell complexes
• Complexes of graph homomorphisms
• Chessboard Complexes and Matching Complexes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A short proof of a conjecture on the connectivity of graph coloring complexes