Abstract
In this note we prove the following theorem. For any three sets of points in the plane, each of $n\ge 2$ points such that any three points (from the union of three sets) are not collinear and the convex hull of $3n$ points is monochromatic, there exists an integer $k\in\{1,2,\dots,n-1\}$ and an open half-plane containing exactly $k$ points from each set.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献