Title

A Colored Version of Tverberg's Theorem

Document Type

Discussion Paper

Publication Date

2-1-1990

CFDP Number

936

CFDP Pages

13

Abstract

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.

This document is currently not available here.

Share

COinS