Erdős-Szekeres theorem for point sets with forbidden subconfigurations
From MaRDI portal
(Redirected from Publication:452006)
Recommendations
Cites work
- scientific article; zbMATH DE number 431988 (Why is no real title available?)
- scientific article; zbMATH DE number 3168302 (Why is no real title available?)
- scientific article; zbMATH DE number 1786502 (Why is no real title available?)
- scientific article; zbMATH DE number 5019923 (Why is no real title available?)
- A Ramsey property of order types
- A decomposition theorem for partially ordered sets
- A new proof of the Erdős-Szekeres convex k-gon result
- A positive fraction Erdős-Szekeres theorem
- Crossing families
- Enumerating order types for small point sets with applications
- Erdős--Szekeres theorem with forbidden order types
- Induced Ramsey-type theorems
- Point configurations in \(d\)-space without large subsets in convex position
- Ramsey-type theorems
- Ramsey-type theorems with forbidden subgraphs
- Sets with No Empty Convex 7-Gons
- The Erdos-Szekeres problem on points in convex position – a survey
- The Erdős-Hajnal conjecture for bull-free graphs
- The partitioned version of the Erdős-Szekeres theorem
Cited in
(9)- Point configurations in \(d\)-space without large subsets in convex position
- More Turán-type theorems for triangles in convex point sets
- Forbidden k‐Sets in the Plane
- Convex hulls of random order types
- New bounds for the same-type lemma
- On some extremal results for order types
- Erdős--Szekeres theorem with forbidden order types
- Erdős-Szekeres theorem for lines
- Extremal and probabilistic results for order types
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)