27 citations · 79 across the 23 of their papers we have counts for
Showing 2006Show all
2 papers · 1 filter
math.AT2006★ 3 cited
Homology tests for graph colorings
Dmitry N. Kozlov
We describe a simple homological test for obstructions to graph colorings. The main idea is to combine the framework of Hom-complexes with the following general fact: an arbitrary…
math.AT2006
Cobounding odd cycle colorings
Dmitry N. Kozlov
We give a very short self-contained combinatorial proof of the Babson-Kozlov conjecture, by presenting a cochain whose coboundary is the desired power of the characteristic class.