An improved upper bound for the Erdős-Szekeres conjecture

DOI10.1007/s00454-016-9791-5zbMath1351.52017arXiv1510.06255OpenAlexW2239826551WikidataQ123241793 ScholiaQ123241793MaRDI QIDQ306509

Hossein Nassajian Mojarrad, Georgios Vlachos

Publication date: 31 August 2016

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

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

zbMATH Keywords

Ramsey theoryconvex polygonsErdős-Szekeres problem

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

• Erdős-Szekeres without induction
• Forced convex \(n\)-gons in the plane
• Finding convex sets among points in the plane
• Note on the Erdős-Szekeres theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An improved upper bound for the Erdős-Szekeres conjecture