Erdős-Szekeres without induction

DOI10.1007/s00454-016-9778-2zbMath1351.52018arXiv1509.03332OpenAlexW2196790641MaRDI QIDQ309659

Yelena Yuditsky, Serguei Norine

Publication date: 7 September 2016

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

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

zbMATH Keywords

Ramsey theoryconvex polygonsErdős-Szekeres problem

Mathematics Subject Classification ID

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

Related Items (4)

On the Erdős-Szekeres convex polygon problem ⋮ An improved upper bound for the Erdős-Szekeres conjecture ⋮ Point sets with small integer coordinates and no large convex polygons ⋮ A SAT attack on the Erdős-Szekeres conjecture

Uses Software

• MathOverflow

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forced convex \(n\)-gons in the plane
• Finding convex sets among points in the plane
• Note on the Erdős-Szekeres theorem
• Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
• Research Problems in Discrete Geometry
• A Simple Proof of a Theorem of Erdös and Szekeres^*
• Computer solution to the 17-point Erdős-Szekeres problem
• The Erdos-Szekeres problem on points in convex position – a survey
• Some Combinatorial Theorems on Monotonicity

This page was built for publication: Erdős-Szekeres without induction