Complexes of graph homomorphisms

Eric Babson, Dmitry N. Kozlov

$Hom(G,H)$ is a polyhedral complex defined for any two undirected graphs $G$ and $H$. This construction was introduced by Lovász to give lower bounds for chromatic numbers of graph…