Fixing a hole

DOI10.1007/s00454-023-00561-6arXiv2108.07087OpenAlexW4386496407MaRDI QIDQ6142356

David Conlon, Unnamed Author

Publication date: 21 December 2023

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

Full work available at URL: https://arxiv.org/abs/2108.07087

zbMATH Keywords

Erdős-Szekeres theoremHorton setsempty convex polytopes

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Convex independent sets and 7-holes in restricted planar point sets
• Sets in \(\mathbb{R}^ d\) with no large empty convex subsets
• Konvexe Fünfecke in ebenen Punktmengen
• Large convex holes in random point sets
• Digital almost nets
• The empty hexagon theorem
• Empty convex hexagons in planar point sets
• The maximum size of a convex polygon in a restricted set of points in the plane
• Sets with No Empty Convex 7-Gons
• On convex holes in d-dimensional point sets