The Erdős-Szekeres Problem

DOI10.1007/978-3-319-32162-2_10zbMath1356.52008OpenAlexW2494351895MaRDI QIDQ2826813

Walter D. jun. Morris, Valeriu Soltan

Publication date: 18 October 2016

Published in: Open Problems in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-32162-2_10

zbMATH Keywords

Ramsey theoryconvex polygonsconvex polytopesErdős-Szekeres problemempty convex polygonsempty convex polytopes

Mathematics Subject Classification ID

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

Tverberg-type theorems with altered intersection patterns (nerves) ⋮ Erdős-Szekeres theorem for \(k\)-flats ⋮ Empty squares in arbitrary orientation among points ⋮ Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points

Cites Work

• Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1
• Computer solution of the almost empty hexagon problem
• A new proof of the Erdős-Szekeres convex k-gon result
• 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
• Some Erdős-Szekeres type results about points in space
• On empty convex polytopes
• Forced convex \(n\)-gons in the plane
• Finding convex sets among points in the plane
• Note on the Erdős-Szekeres theorem
• Point configurations in \(d\)-space without large subsets in convex position
• Finding sets of points without empty convex 6-gons
• Two upper bounds for the Erdős-Szekeres number with conditions
• On the Erdös-Szekeres problem
• The empty hexagon theorem
• Empty convex hexagons in planar point sets
• Erdős-Szekeres-type theorems for monotone paths and convex bodies
• Research Problems in Discrete Geometry
• Computer solution to the 17-point Erdős-Szekeres problem
• The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
• Hypergraph Ramsey numbers
• Sets with No Empty Convex 7-Gons
• On Convex Polygons Determined by a Finite Planar Set
• 60.13 A New Proof of a Theorem of Erdös and Szekeres
• The Erdos-Szekeres problem on points in convex position – a survey
• Ramsey-remainder for convex sets and the Erdős-Szekeres theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item