Constructions from empty polygons

DOI10.1007/s10998-004-0518-7zbMath1068.52023OpenAlexW2014439009MaRDI QIDQ558322

Gyula Károlyi, Kiyoshi Hosono, Tibor Bisztriczky, Masatsugu Urabe

Publication date: 5 July 2005

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10998-004-0518-7

zbMATH Keywords

Erdős-Szekeres theoremcombinatorial convexitypoint configurationsempty polygon

Mathematics Subject Classification ID

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

Related Items (4)

On the existence of a point subset with three or five interior points ⋮ Every large point set contains many collinear points or an empty pentagon ⋮ More on planar point subsets with a specified number of interior points ⋮ More on an Erdős-Szekeres-type problem for interior points

Cites Work

• Large empty convex polygons in \(k\)-convex sets
• A sufficient condition for the existence of large empty convex polygons
• Sets with No Empty Convex 7-Gons
• A modular version of the Erdős– Szekeres theorem
• Almost empty polygons
• On the existence of a point subset with a specified number of interior points

This page was built for publication: Constructions from empty polygons