A Note on the Minimum Size of a Point Set Containing Three Nonintersecting Empty Convex Polygons
Author:
Yang Qing,You Zengtai,You Xinshang
Abstract
Let P be a planar point set with no three points collinear, k points of P be a k-hole of P if the k points are the vertices of a convex polygon without points of P. This article proves 13 is the smallest integer such that any planar points set containing at least 13 points with no three points collinear, contains a 3-hole, a 4-hole and a 5-hole which are pairwise disjoint.
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference21 articles.
1. A combinatorial problem in geometry;Erdős;Compos. Math.,1935
2. On some extremum problem in elementary geometry;Erdős;Ann. Univ. Sci. Budapest,1960
3. Computer solution to the 17-point Erdős-Szekeres problem
4. Konvexe Funfeck in ebenen Punktmengen;Harborth;Elem. Math.,1978
5. Sets with No Empty Convex 7-Gons