Erdős-Szekeres theorem for point sets with forbidden subconfigurations
From MaRDI portal
Publication:452006
DOI10.1007/S00454-012-9424-6zbMATH Open1253.52006OpenAlexW2030260203MaRDI QIDQ452006FDOQ452006
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
Recommendations
Cites Work
- A decomposition theorem for partially ordered sets
- Title not available (Why is that?)
- Sets with No Empty Convex 7-Gons
- Title not available (Why is that?)
- The Erdos-Szekeres problem on points in convex position – a survey
- Title not available (Why is that?)
- Induced Ramsey-type theorems
- Ramsey-type theorems
- The Erdős-Hajnal conjecture for bull-free graphs
- Point configurations in \(d\)-space without large subsets in convex position
- Title not available (Why is that?)
- Ramsey-type theorems with forbidden subgraphs
- Enumerating order types for small point sets with applications
- Crossing families
- A new proof of the Erdős-Szekeres convex k-gon result
- A Ramsey property of order types
- A positive fraction Erdős-Szekeres theorem
- The partitioned version of the Erdős-Szekeres theorem
- Erdős--Szekeres theorem with forbidden order types
Cited In (6)
This page was built for publication: Erdős-Szekeres theorem for point sets with forbidden subconfigurations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452006)