13 citations · 19 across the 4 of their papers we have counts for
4 papers
2-Colored Matchings in a 3-Colored K^{3}_{12}
Neal Bushaw, Peter Csorba, Lindsay Erickson +5
Let denote the complete -uniform hypergraph on vertices. A matching in a hypergraph is a set of pairwise vertex disjoint edges. Recent Ramsey-type results re…
Graph coloring manifolds
Peter Csorba, Frank H. Lutz
We introduce a new and rich class of graph coloring manifolds via the Hom complex construction of Lovasz. The class comprises examples of Stiefel manifolds, series of spheres and p…
Homotopy types of box complexes
Peter Csorba
In [MZ04] Matousek and Ziegler compared various topological lower bounds for the chromatic number. They proved that Lovasz's original bound [L78] can be restated as $\chr G \geq \i…
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…