The partitioned version of the Erdős-Szekeres theorem

DOI10.1007/s00454-002-2894-1zbMath1019.52011OpenAlexW2093184634MaRDI QIDQ1864120

Attila Pór, Pavel Valtr

Publication date: 17 March 2003

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

Full work available at URL: https://doi.org/10.1007/s00454-002-2894-1

zbMATH Keywords

Erdős-Szekeres theorem\(k\)-clusteringpoints in convex positionpositive fraction Erdős-Szekeres theorem

Mathematics Subject Classification ID

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

Related Items (13)

On the Erdős-Szekeres convex polygon problem ⋮ On the positive fraction Erdős-Szekeres theorem for convex sets ⋮ A survey of mass partitions ⋮ Crossing and intersecting families of geometric graphs on point sets ⋮ A positive fraction Erdős-Szekeres theorem and its applications ⋮ Chromatic variants of the Erdős--Szekeres theorem on points in convex position. ⋮ Erdős-Szekeres theorem for point sets with forbidden subconfigurations ⋮ Two extensions of the Erdős-Szekeres problem ⋮ On \(k\)-convex point sets ⋮ A positive fraction mutually avoiding sets theorem ⋮ On Erdős-Szekeres-type problems for \(k\)-convex point sets ⋮ Erdős-Szekeres theorem for lines ⋮ THE ERDŐS–SZEKERES PROBLEM FOR NON‐CROSSING CONVEX SETS

This page was built for publication: The partitioned version of the Erdős-Szekeres theorem