Chromatic variants of the Erdős--Szekeres theorem on points in convex position.

DOI10.1016/S0925-7721(03)00013-0zbMath1034.52014MaRDI QIDQ1410590

Olivier Devillers, Carlos Seara, Ferran Hurtado, Gyula Károlyi

Publication date: 14 October 2003

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

Erdős-Szekeres theoremcombinatorial convexityRamsey theorypoint configurationschromatic sets

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Other problems of combinatorial convexity (52A37) Ramsey theory (05D10)

Related Items (22)

Drawing the Horton set in an integer grid of minimum size ⋮ Two disjoint 5-holes in point sets ⋮ Empty monochromatic triangles ⋮ Almost empty monochromatic triangles in planar point sets ⋮ Covering the convex quadrilaterals of point sets ⋮ Discrete geometry on colored point sets in the plane -- a survey ⋮ Carathéodory's theorem in depth ⋮ Monochromatic empty triangles in two-colored point sets ⋮ On rainbow quadrilaterals in colored point sets ⋮ The Mathematics of Ferran Hurtado: A Brief Survey ⋮ On geometric graphs on point sets in the plane ⋮ On balanced 4-holes in bichromatic point sets ⋮ Blocking the \(k\)-holes of point sets in the plane ⋮ Empty rainbow triangles in \(k\)-colored point sets ⋮ A note on empty balanced tetrahedra in two-colored point sets in \(\mathbb{R}^3\) ⋮ Empty monochromatic simplices ⋮ Almost empty monochromatic quadrilaterals in planar point sets ⋮ Rainbow polygons for colored point sets in the plane ⋮ On almost empty monochromatic triangles and convex quadrilaterals in colored point sets ⋮ A Ramsey-type result for geometric \(\ell\)-hypergraphs ⋮ On polygons enclosing point sets. II ⋮ Points surrounding the origin

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On empty triangles determined by points in the plane
• On the generalized Erdös-Szekeres conjecture -- a new upper bound
• A generalization of Caratheodory's theorem
• Some notes on the Erdős-Szekeres theorem
• The colored Tverberg's problem and complexes of injective functions
• Sets in \(\mathbb{R}^ d\) with no large empty convex subsets
• Konvexe Fünfecke in ebenen Punktmengen
• Ramsey-type results for geometric graphs. II
• A Ramsey property of order types
• Ramsey-type results for geometric graphs. I
• A positive fraction Erdős-Szekeres theorem
• Note on the Erdős-Szekeres theorem
• The partitioned version of the Erdős-Szekeres theorem
• On a partition into convex polygons
• Ramsey-remainder
• Planar sets with few empty convex polygons
• Sets with No Empty Convex 7-Gons
• Empty Simplices in Euclidean Space
• A generalization of the Erdös-Szekeres convex n-gon theorem.
• A Ramsey-Type Theorem in the Plane
• The Erdos-Szekeres problem on points in convex position – a survey
• A modular version of the Erdős– Szekeres theorem
• PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS
• Ramsey-remainder for convex sets and the Erdős-Szekeres theorem
• On the number of disjoint convex quadrilaterals for a planar point set

This page was built for publication: Chromatic variants of the Erdős--Szekeres theorem on points in convex position.