A short proof of a conjecture on the higher connectivity of graph coloring complexes
Combinatorics
2007-05-23 v1 Algebraic Topology
Abstract
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.
Cite
@article{arxiv.math/0505460,
title = {A short proof of a conjecture on the higher connectivity of graph coloring complexes},
author = {Alexander Engstrom},
journal= {arXiv preprint arXiv:math/0505460},
year = {2007}
}
Comments
3 pages