Empty convex polygons in almost convex sets
- 119 Downloads
A finite set of points, in general position in the plane, is almost convex if every triple determines a triangle with at most one point in its interior. For every ℓ ≥ 3, we determine the maximum size of an almost convex set that does not contain the vertex set of an empty convex ℓ-gon.
Key words and phrasespoint configurations combinatorial convexity Erdős-Szekeres problem empty polygons
Mathematics subject classification number52C10
Unable to display preview. Download preview PDF.
- P. Erdős and Gy. Szekeres, A combinatorial problem in geometry, Compositio Math., 2 (1935), 464–470.Google Scholar
- T. Gerken, Empty convex hexagons in planar point sets, Discrete Comput. Geom., to appear.Google Scholar
- P. Valtr, On the empty hexagons, submitted.Google Scholar