A Colored Version of Tverberg's Theorem

Abstract

The main result of this paper is that given r red, r white, and r green points in the plane, it is possible to form r vertex-disjoint triangles δi,…,δr in such a way that δi has one red, one white, and one green vertex for every i = l,…,r and the intersection of these triangles is non-empty.