The Erdos-Szekeres problem on points in convex position – a survey

DOI10.1090/S0273-0979-00-00877-6zbMath0958.52018OpenAlexW2083028555WikidataQ55969515 ScholiaQ55969515MaRDI QIDQ4501063

Walter D. jun. Morris, Valeriu Soltan

Publication date: 3 September 2000

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0273-0979-00-00877-6

zbMATH Keywords

surveyconvex bodiesabstract convexityErdős-Szekeres problem

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02)

Related Items

On the Erdős-Szekeres convex polygon problem, Erdős--Szekeres theorem with forbidden order types, Convex Polygons in Geometric Triangulations, Erdős-Szekeres without induction, On the Erdös-Szekeres problem, On the decay of the smallest singular value of submatrices of rectangular matrices, Convex Polygons in Geometric Triangulations, Finite sets as complements of finite unions of convex sets, On weighted sums of numbers of convex polygons in point sets, On the order dimension of convex geometries, The non-planarity of \(K_{5}\) and \(K_{3,3}\) as axioms for plane ordered geometry, Chromatic numbers of copoint graphs of convex geometries, Supervised box clustering, On scattered convex geometries, Erdős-Szekeres theorem for \(k\)-flats, On the Erdős–Szekeres problem in combinatorial geometry, Erdős-Szekeres ``happy end-type theorems for separoïds, Two upper bounds for the Erdős-Szekeres number with conditions, Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set, Large convex holes in random point sets, 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, Representing finite convex geometries by relatively convex sets, Point sets with small integer coordinates and no large convex polygons, Interior points in the Erdős-Szekeres theorems, Higher-order Erdős-Szekeres theorems, Empty squares in arbitrary orientation among points, The Erdős-Szekeres theorem and congruences, Erdős-Szekeres theorem for point sets with forbidden subconfigurations, Point configurations in \(d\)-space without large subsets in convex position, Computer solution of the almost empty hexagon problem, Unnamed Item, Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1, Computer solution to the 17-point Erdős-Szekeres problem, Almost empty hexagons, Every large point set contains many collinear points or an empty pentagon, A Note on the Number of Empty Triangles, A simple proof for open cups and caps, Maximum Rectilinear Convex Subsets, Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points, Specified holes with pairwise disjoint interiors in planar point sets, Disjoint empty convex pentagons in planar point sets, Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem, Empty convex hexagons in planar point sets, Unnamed Item, Obstacle numbers of graphs, Coloring copoints of a planar point set, Regular systems of paths and families of convex sets in convex position, On the Erdős-Szekeres \(n\)-interior-point problem, Around Erdős-Szekeres problems, More on planar point subsets with a specified number of interior points, Erdős-Szekeres theorem for lines, The Erdős-Szekeres Problem, More on an Erdős-Szekeres-type problem for interior points, THE ERDŐS–SZEKERES PROBLEM FOR NON‐CROSSING CONVEX SETS, Three-monotone interpolation

Cites Work

• On monochromatic triangles
• Greedoids
• Searching for empty convex polygons
• The theory of convex geometries
• A new proof of the Erdős-Szekeres convex k-gon result
• On empty triangles determined by points in the plane
• Nine convex sets determine a pentagon with convex sets as vertices
• On the generalized Erdös-Szekeres conjecture -- a new upper bound
• Partition numbers for trees and ordered sets
• A theorem of ordered duality
• Some notes on the Erdős-Szekeres theorem
• Convex independent sets and 7-holes in restricted planar point sets
• Unsolved problems in geometry
• Sets in \(\mathbb{R}^ d\) with no large empty convex subsets
• On some problems of elementary and combinatorial geometry
• Konvexe Fünfecke in ebenen Punktmengen
• 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
• Canonical theorems for convex sets
• A generalisation of the Erdős-Szekeres theorem to disjoint convex sets
• Note on the Erdős-Szekeres theorem
• Convex dimension of locally planar convex geometries
• On a partition into convex polygons
• Ramsey-remainder
• Convexly independent sets
• The maximum size of a convex polygon in a restricted set of points in the plane
• 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.
• On Convex Polygons Determined by a Finite Planar Set
• 60.13 A New Proof of a Theorem of Erdös and Szekeres
• A Ramsey-Type Theorem in the Plane
• Cooperative classes of finite sets in one and more dimensions
• Bounds assuring subsets in convex position
• On the number of disjoint convex quadrilaterals for a planar point set
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item