5 citations · 10 across the 3 of their papers we have counts for
Showing 2004 · math.COShow all
2 papers · 2 filters
math.CO2004★ 5 cited
Higher connectivity of graph coloring complexes
Sonja Lj. Cukic, Dmitry N. Kozlov
The main result of this paper is a proof of the following conjecture of Babson & Kozlov: Theorem. Let G be a graph of maximal valency d, then the complex Hom(G,K_n) is at least (n-…
math.CO2004★ 5 cited
The homotopy type of complexes of graph homomorphisms between cycles
Sonja Lj. Cukic, Dmitry N. Kozlov
In this paper we study the homotopy type of $\Hom(C_m,C_n)$, where is the cyclic graph with vertices. We enumerate connected components of $\Hom(C_m,C_n)$ and show that e…