A sufficient condition for the existence of large empty convex polygons

DOI10.1007/s00454-002-2898-xzbMath1022.52007OpenAlexW2090067893MaRDI QIDQ1864123

Pavel Valtr

Publication date: 17 March 2003

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-002-2898-x

zbMATH Keywords

Erdős-Szekeres theoremempty polygons

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Erd?s problems and related topics of discrete geometry (52C10) Convex sets in (2) dimensions (including convex curves) (52A10) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (6)

On \(k\)-convex polygons ⋮ Every large point set contains many collinear points or an empty pentagon ⋮ A simple proof for open cups and caps ⋮ Constructions from empty polygons ⋮ Holes in 2-convex point sets ⋮ More on an Erdős-Szekeres-type problem for interior points

This page was built for publication: A sufficient condition for the existence of large empty convex polygons