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

Simple item page
dc.creatorEngstrom, Alexander
dc.date2005-05-22
dc.date.accessioned2026-07-07T05:20:08Z
dc.date.available2026-07-07T05:20:08Z
dc.descriptionThe Hom-complexes were introduced by Lovasz to study topological obstructions to graph colorings. It was conjectured by Babson and Kozlov, and proved by Cukic and Kozlov, that Hom(G,K_n) is (n-d-2)-connected, where d is the maximal degree of a vertex of G. We give a short proof of the conjecture.
dc.description3 pages
dc.identifierhttps://arxiv.org/abs/math/0505460
dc.identifierhttp://arxiv.org/abs/math/0505460
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/75271
dc.subjectCombinatorics
dc.subjectAlgebraic Topology
dc.subject57M15, 05C15
dc.titleA short proof of a conjecture on the higher connectivity of graph coloring complexes
dc.typetext

Files

Collections

arXiv