A short proof of a conjecture on the higher connectivity of graph coloring complexes
Abstract
Description
The 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.
3 pages
3 pages