论文信息 - A Colored Version of Tverberg's Theorem

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 Delta_{1},...,Delta_{n} in such a way that the Delta_{i} has one red, one white, and one green vertex for every i = 1,...,n and the intersection of these triangles is nonempty.

I. Bárány | D. Larman

[1] Leonidas J. Guibas,et al. Points and triangles in the plane and halving planes in space , 1990, SCG '90.

[2] Zoltán Füredi,et al. On the number of halving planes , 1990, Comb..

[3] P. Erdös,et al. Dissection Graphs of Planar Point Sets , 1973 .

[4] H. Tverberg. A Generalization of Radon's Theorem , 1966 .

[5] Karol Borsuk. Drei Sätze über die n-dimensionale euklidische Sphäre , 1933 .

[6] J. Radon. Mengen konvexer Körper, die einen gemeinsamen Punkt enthalten , 1921 .