Ramsey-remainder for convex sets and the Erdős-Szekeres theorem

DOI10.1016/S0166-218X(00)00234-1zbMath0974.52014OpenAlexW1981259396MaRDI QIDQ5929326

Gyula Károlyi

Publication date: 16 December 2001

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00234-1

zbMATH Keywords

Erdős-Szekeres theoremcombinatorial convexitygeometric algorithmspartition into convex subsetsRamsey-remainder

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

On the Erdős-Szekeres convex polygon problem, Erdős-Szekeres ``happy end-type theorems for separoïds, Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set, Chromatic variants of the Erdős--Szekeres theorem on points in convex position., Bottleneck convex subsets: finding \(k\) large convex sets in a point set, THE ERDŐS–SZEKERES PROBLEM AND AN INDUCED RAMSEY QUESTION, Point configurations in \(d\)-space without large subsets in convex position, Unnamed Item, A Ramsey-type result for geometric \(\ell\)-hypergraphs, The Erdős-Szekeres Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposition of large uniform hypergraphs
• Decompositions of partially ordered sets into chains and antichains of given size
• Sets in \(\mathbb{R}^ d\) with no large empty convex subsets
• Some Erdős-Szekeres type results about points in space
• On empty convex polytopes
• A positive fraction Erdős-Szekeres theorem
• Forced convex \(n\)-gons in the plane
• Finding convex sets among points in the plane
• Note on the Erdős-Szekeres theorem
• Ramsey-remainder
• Sets with No Empty Convex 7-Gons
• An Erdős-Szekeres type problem in the plane