27 citations · 75 across the 20 of their papers we have counts for
Showing 2003 · math.COShow all
3 papers · 2 filters
math.CO2003★ 9 cited
Complexes of graph homomorphisms
Eric Babson, Dmitry N. Kozlov
is a polyhedral complex defined for any two undirected graphs and . This construction was introduced by Lovász to give lower bounds for chromatic numbers of graph…
math.CO2003★ 2 cited
Incidence combinatorics of resolutions
Eva Maria Feichtner, Dmitry N. Kozlov
We introduce notions of combinatorial blowups, building sets, and nested sets for arbitrary meet-semilattices. This gives a common abstract framework for the incidence combinatoric…
math.CO2003
Topological obstructions to graph colorings
Eric Babson, Dmitry N. Kozlov
For any two graphs and Lovász has defined a cell complex having in mind the general program that the algebraic invariants of these complexes should provide obstr…