A modular version of the Erdős– Szekeres theorem

DOI10.1556/SScMath.38.2001.1-4.17zbMath1006.52007OpenAlexW1986877971MaRDI QIDQ4793057

János Pach, Géza Tóth, Gyula Károlyi

Publication date: 18 February 2003

Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1556/sscmath.38.2001.1-4.17

zbMATH Keywords

combinatorial convexityRamsey theoryconvex polygonsEsther-Klein-problemempty polygonsErdős-Szekeres problemalmost convex setsHappy End theorem

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Other problems of combinatorial convexity (52A37) Ramsey theory (05D10)

Related Items (10)

Drawing the almost convex set in an integer grid of minimum size ⋮ Chromatic variants of the Erdős--Szekeres theorem on points in convex position. ⋮ The Erdős-Szekeres theorem and congruences ⋮ 4-holes in point sets ⋮ A simple proof for open cups and caps ⋮ Blocking the \(k\)-holes of point sets in the plane ⋮ Constructions from empty polygons ⋮ On the Erdős-Szekeres \(n\)-interior-point problem ⋮ More on an Erdős-Szekeres-type problem for interior points ⋮ On Erdős-Szekeres-type problems

This page was built for publication: A modular version of the Erdős– Szekeres theorem