Benjamin Matschke

The "colored Tverberg problem" asks for a smallest size of the color classes in a (d+1)-colored point set C in R^d that forces the existence of an intersecting family of r "rainbow" simplices with disjoint, multicolored vertex sets from C. Using...