Abstract
A point set \(P\) is k-convex if there are at most k points of \(P\) in any triangle having its vertices in \(P\). Károlyi, Pach and Tóth [6] showed that if a 1-convex set has sufficiently many points, then it contains an arbitrarily large emtpy convex polygon. They also constructed exponentially large 1-convex sets that contain no empty convex n-gons. Here we shall give an exponential upper bound to the number of points needed. Valtr [8] proved a similar result for k-convex sets. In this paper we improve his upper bound and give an elementary proof of the statement.
Similar content being viewed by others
REFERENCES
I. BÁrÁny and GY. KÁrolyi, Problems and results about the Erdős-Szekeres convex polygon theorem, in: Discrete and Computational Geometry (ed. by J. Akiyama, M. Kano and M. Urabe) LNCS 2098, Springer, 2001, 91–105.
P. Erdős and G. Szekeres, A combinatorial problem in geometry, Comp.Math. 2 (1935), 463–470.
H. Harborth, Konvexe Fünfecke in ebenen Punktmengen, Elem.Math. 33 (1978), 116–118.
J. D. Horton, Sets with no empty 7-gons, Canad.Math.Bull. 26 (1983), 482–484.
K. Hosono, GY. KÁrolyi and M. Urabe, Constructions from empty polygons, in: Discrete geometry: In Honor of W. Kuperberg's 60th Birtday (ed. by A. Bezdek), Marcel Dekker, (to appear).
GY. KÁrolyi, J. Pach and G. TÓth, A modular version of the Erdős-Szekeres theorem, Studia Set.Math.Hungar. 38 (2001), 245–259.
W. Morris and V. Soltan, The Erdős-Szekeres problem on points in convex position-a survey, Bull.Amer.Math.Soc. 37 (2000), 437–458.
P. Valtr, A sufficient condition for the existence of large empty convex polygons, Discrete Comput.Geom,. 28 (2002), 671–682.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kun, G., Lippner, G. Large empty convex polygons in k-convex sets. Periodica Mathematica Hungarica 46, 81–88 (2003). https://doi.org/10.1023/A:1025757808886
Issue Date:
DOI: https://doi.org/10.1023/A:1025757808886