Erdős-Szekeres theorem for point sets with forbidden subconfigurations

DOI10.1007/s00454-012-9424-6zbMath1253.52006OpenAlexW2030260203MaRDI QIDQ452006

Gyula Károlyi, Géza Tóth

Publication date: 19 September 2012

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

Full work available at URL: https://doi.org/10.1007/s00454-012-9424-6

zbMATH Keywords

Erdős-Szekeres theoremcombinatorial convexityorder type

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ramsey-type theorems
• The Erdős-Hajnal conjecture for bull-free graphs
• A new proof of the Erdős-Szekeres convex k-gon result
• Crossing families
• A Ramsey property of order types
• A positive fraction Erdős-Szekeres theorem
• Point configurations in \(d\)-space without large subsets in convex position
• Enumerating order types for small point sets with applications
• The partitioned version of the Erdős-Szekeres theorem
• Erdős--Szekeres theorem with forbidden order types
• A decomposition theorem for partially ordered sets
• Sets with No Empty Convex 7-Gons
• The Erdos-Szekeres problem on points in convex position – a survey
• Induced Ramsey-type theorems
• Ramsey-type theorems with forbidden subgraphs

This page was built for publication: Erdős-Szekeres theorem for point sets with forbidden subconfigurations