Box complexes, neighborhood complexes, and the chromatic number

Peter Csorba, Carsten Lange, Ingo Schurr +1

Lovasz's striking proof of Kneser's conjecture from 1978 using the Borsuk--Ulam theorem provides a lower bound on the chromatic number of a graph. We introduce the shore subdivisio…