Skip to main content
Discussion Paper

A Colored Version of Tverberg's Theorem

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