Almost empty polygons
The well-known Erdős-Szekeres convex polygon theorem guarantees that any sufficiently large number of points in general position in the plane will contain \(n\) points in convex position: the vertex set of a convex \(n\)-gon. This led Erdős to the question whether this \(n\)-gon can even be chosen to be empty, but that turned out to be false: \textit{J. D. Horton} [Can. Math. Bull. 26, 482--484 (1983; Zbl 0521.52010)] constructed arbitrarily large sets without empty convex 7-gon. On the other hand, any set of at least \(n\) points contains an empty 5-gon, see \textit{H. Harborth} [Elem. Math. 33, 116--118 (1978; Zbl 0397.52005)], leaving only the empty 6-gon case open, see \textit{M. Overmars} [Discrete Comput. Geom. 29, 153--158 (2003; Zbl 1019.52010)]. In this paper, the emptyness restriction is relaxed. Thus we do not know whether every sufficiently large set contains an empty convex 6-gon, but the author shows that it does contain a 6-gon with at most five points in its interior. And in general, the author constructs arbitrary large sets without an \(n\)-gon containing at most \(k\) points in the interior for \(k\leq 2^{(n+6)/4} - n -3\).
- Convex independent sets and 7-holes in restricted planar point sets
- Large empty convex polygons in \(k\)-convex sets
- Drawing the Horton set in an integer grid of minimum size
- A sufficient condition for the existence of large empty convex polygons
- Finding sets of points without empty convex 6-gons
- On almost empty monochromatic triangles and convex quadrilaterals in colored point sets
- Interior points in the Erdős-Szekeres theorems
- Almost empty hexagons
- The empty hexagon theorem
- Planar sets with few empty convex polygons
- On Erdős-Szekeres-type problems
- Almost empty monochromatic triangles in planar point sets
- Empty pentagons in point sets with collinearities
- On empty hexagons
- Empty convex hexagons in planar point sets
- EMPTY CONVEX 5-GONS IN PLANAR POINT SETS
- scientific article; zbMATH DE number 881170 (Why is no real title available?)
- Constructions from empty polygons
- Qualitative infinite version of Erdős' problem about empty polygons
- Every large point set contains many collinear points or an empty pentagon
- Almost empty monochromatic polygons in planar point sets
- Almost empty monochromatic quadrilaterals in planar point sets
- Empty convex polygons in almost convex sets
This page was built for publication: Almost empty polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820754)