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

DOI10.1090/S0273-0979-00-00877-6zbMATH Open0958.52018OpenAlexW2083028555WikidataQ55969515 ScholiaQ55969515MaRDI QIDQ4501063FDOQ4501063

Authors: Walter 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

Recommendations

• On Erdős-Szekeres-type problems for \(k\)-convex point sets
• On Erdős-Szekeres-type problems for \(k\)-convex point sets
• scientific article; zbMATH DE number 1786502
• scientific article; zbMATH DE number 2068096
• On the Erdős-Szekeres \(n\)-interior point problem
• On the Erdős-Szekeres convex polygon problem
• On the Erdős-Szekeres \(n\)-interior-point problem
• The Erdős-Szekeres problem for non-crossing convex sets
• Some Erdős-Szekeres type results about points in space
• A generalization of the Erdös-Szekeres convex n-gon theorem.

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The theory of convex geometries
• Unsolved problems in geometry
• On empty triangles determined by points in the plane
• Planar sets with few empty convex polygons
• Empty Simplices in Euclidean Space
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Partition numbers for trees and ordered sets
• Konvexe Fünfecke in ebenen Punktmengen
• Title not available (Why is that?)
• Sets with No Empty Convex 7-Gons
• Title not available (Why is that?)
• Title not available (Why is that?)
• Forced convex \(n\)-gons in the plane
• Finding convex sets among points in the plane
• Note on the Erdős-Szekeres theorem
• On some problems of elementary and combinatorial geometry
• Convex independent sets and 7-holes in restricted planar point sets
• Title not available (Why is that?)
• On a partition into convex polygons
• On the number of disjoint convex quadrilaterals for a planar point set
• A theorem of ordered duality
• The maximum size of a convex polygon in a restricted set of points in the plane
• Convex dimension of locally planar convex geometries
• Searching for empty convex polygons
• Greedoids
• A new proof of the Erdős-Szekeres convex k-gon result
• A positive fraction Erdős-Szekeres theorem
• Title not available (Why is that?)
• Title not available (Why is that?)
• A generalization of the Erdös-Szekeres convex n-gon theorem.
• On empty convex polytopes
• On monochromatic triangles
• A generalisation of the Erdős-Szekeres theorem to disjoint convex sets
• Title not available (Why is that?)
• On Convex Polygons Determined by a Finite Planar Set
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the generalized Erdös-Szekeres conjecture -- a new upper bound
• Some notes on the Erdős-Szekeres theorem
• Canonical theorems for convex sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sets in \(\mathbb{R}^ d\) with no large empty convex subsets
• Convexly independent sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some Erdős-Szekeres type results about points in space
• Nine convex sets determine a pentagon with convex sets as vertices
• A Ramsey-Type Theorem in the Plane
• Cooperative classes of finite sets in one and more dimensions
• Bounds assuring subsets in convex position
• Ramsey-remainder
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 60.13 A New Proof of a Theorem of Erdös and Szekeres
• Title not available (Why is that?)

Cited In (60)

• Title not available (Why is that?)
• Erdős-Szekeres theorem for \(k\)-flats
• A SAT attack on higher dimensional Erdős-Szekeres numbers
• The never-ending happiness of Paul Erdős's mathematics
• Automated mathematical discovery and verification: minimizing pentagons in the plane
• Maximum Rectilinear Convex Subsets
• Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
• Convex Polygons in Geometric Triangulations
• Computer solution to the 17-point Erdős-Szekeres problem
• Chromatic numbers of copoint graphs of convex geometries
• Point configurations in \(d\)-space without large subsets in convex position
• Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points
• Obstacle numbers of graphs
• Regular systems of paths and families of convex sets in convex position
• More on planar point subsets with a specified number of interior points
• Empty squares in arbitrary orientation among points
• A simple proof for open cups and caps
• Convex Polygons in Geometric Triangulations
• Title not available (Why is that?)
• Disjoint empty convex pentagons in planar point sets
• Specified holes with pairwise disjoint interiors in planar point sets
• Coloring copoints of a planar point set
• Computer solution of the almost empty hexagon problem
• Finite sets as complements of finite unions of convex sets
• On the Erdős-Szekeres \(n\)-interior-point problem
• On the Erdős-Szekeres \(n\)-interior point problem
• On scattered convex geometries
• On the decay of the smallest singular value of submatrices of rectangular matrices
• A note on the number of empty triangles
• The non-planarity of \(K_{5}\) and \(K_{3,3}\) as axioms for plane ordered geometry
• Two upper bounds for the Erdős-Szekeres number with conditions
• Large convex holes in random point sets
• Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
• On the Erdös-Szekeres problem
• On the Erdős–Szekeres problem in combinatorial geometry
• More on an Erdős-Szekeres-type problem for interior points
• The Erdős-Szekeres theorem and congruences
• Interior points in the Erdős-Szekeres theorems
• On weighted sums of numbers of convex polygons in point sets
• Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
• The Erdős-Szekeres Problem
• Erdős-Szekeres without induction
• Around Erdős-Szekeres problems
• Erdős--Szekeres theorem with forbidden order types
• Erdős-Szekeres theorem for point sets with forbidden subconfigurations
• Representing finite convex geometries by relatively convex sets
• Erdős-Szekeres theorem for lines
• Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1
• Supervised box clustering
• Point sets with small integer coordinates and no large convex polygons
• Erdős-Szekeres ``happy end-type theorems for separoïds
• Almost empty hexagons
• Empty convex hexagons in planar point sets
• Bottleneck convex subsets: finding \(k\) large convex sets in a point set
• On the Erdős-Szekeres convex polygon problem
• Every large point set contains many collinear points or an empty pentagon
• Higher-order Erdős-Szekeres theorems
• On the order dimension of convex geometries
• The Erdős-Szekeres problem for non-crossing convex sets
• Three-monotone interpolation

This page was built for publication: The Erdos-Szekeres problem on points in convex position – a survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501063)