Two upper bounds for the Erdős-Szekeres number with conditions

DOI10.1007/s00454-012-9474-9zbMath1268.52013OpenAlexW2116748315MaRDI QIDQ1943650

Florian Strunk

Publication date: 20 March 2013

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

Full work available at URL: https://doi.org/10.1007/s00454-012-9474-9

zbMATH Keywords

combinatorial convexitydiscrete geometryErdős-Szekeres problem

Mathematics Subject Classification ID

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

Related Items (1)

The Erdős-Szekeres Problem

Cites Work

• Forced convex \(n\)-gons in the plane
• Finding convex sets among points in the plane
• Note on the Erdős-Szekeres theorem
• Computer solution to the 17-point Erdős-Szekeres problem
• The Erdos-Szekeres problem on points in convex position – a survey
• Unnamed Item
• Unnamed Item

This page was built for publication: Two upper bounds for the Erdős-Szekeres number with conditions