1 citations · 2 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2003★ 1 cited
On generalised Kneser colourings
Carsten Lange
There are two possible definitions of the "s-disjoint r-uniform Kneser hypergraph'' of a set system T: The hyperedges are either r-sets or r-multisets. We point out that Ziegler's…
math.CO2003★ 1 cited
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…