# On the Erdos-Szekeres convex polygon problem

@article{Suk2016OnTE,
title={On the Erdos-Szekeres convex polygon problem},
author={Andrew Suk},
journal={ArXiv},
year={2016},
volume={abs/1604.08657}
}
• Andrew Suk
• Published 2016
• Mathematics, Computer Science
• ArXiv
Let $ES(n)$ be the smallest integer such that any set of $ES(n)$ points in the plane in general position contains $n$ points in convex position. In their seminal 1935 paper, Erdos and Szekeres showed that $ES(n) \leq {2n - 4\choose n-2} + 1 = 4^{n -o(n)}$. In 1960, they showed that $ES(n) \geq 2^{n-2} + 1$ and conjectured this to be optimal. In this paper, we nearly settle the Erdos-Szekeres conjecture by showing that $ES(n) =2^{n +o(n)}$.

#### Paper Mentions

Erdös-Szekeres Convex Polygon Problem
A set of points in the plane is said to be in general position if it contains no three points on a line. A finite set of points in the plane is in convex position, if it is the vertex set of a convexExpand
On some algebraic and extremal problems in discrete geometry
In the present thesis, we delve into different extremal and algebraic problems arising from combinatorial geometry. Specifically, we consider the following problems. For any integer $n\ge 3$, weExpand
Point Sets with Small Integer Coordinates and No Large Convex Polygons
• Computer Science, Mathematics
• Discret. Comput. Geom.
• 2018
This paper shows how to realize Erdős and Szekeres' proofs of convex polygon construction in an integer grid of size O(n^2 \log _2(n)^3). Expand
The Erdos-Szekeres problem and an induced Ramsey question
• Mathematics
• 2018
Motivated by the Erdos-Szekeres convex polytope conjecture in $R^d$, we initiate the study of the following induced Ramsey problem for hypergraphs. Given integers $n > k \geq 5$, what is the minimumExpand
Two extensions of the Erd\H{o}s-Szekeres problem
• Mathematics
• 2017
According to Suk's breakthrough result on the Erdos-Szekeres problem, any point set in general position in the plane, which has no $n$ elements that form the vertex set of a convex $n$-gon, has atExpand
On Erdős-Szekeres-Type Problems for k-convex Point Sets
• Mathematics, Computer Science
• IWOCA
• 2019
The well-known Erdős–Szekeres Theorem is extended by showing that, for every fixed $$k \in \mathbb {N}$$, every set of n points in the plane in general position contains a k-convex subset of size at least $$\varOmega (\log ^k{n})$$. Expand
Two extensions of the Erdős–Szekeres problem
• Mathematics
• 2017
According to Suk’s breakthrough result on the Erdős–Szekeres problem, any point set in general position in the plane, which has no n elements that form the vertex set of a convex n-gon, has at mostExpand
On Equal Point Separation by Planar Cell Decompositions
In this paper, we investigate the problem of separating a set $X$ of points in $\mathbb{R}^{2}$ with an arrangement of $K$ lines such that each cell contains an asymptotically equal number of pointsExpand
On weighted sums of numbers of convex polygons in point sets
• Mathematics
• 2019
Let $S$ be a set of $n$ points in general position in the plane, and let $X_{k,\ell}(S)$ be the number of convex $k$-gons with vertices in $S$ that have exactly $\ell$ points of $S$ in theirExpand
On Erdős-Szekeres-type problems for k-convex point sets
• Computer Science, Mathematics
• Eur. J. Comb.
• 2020
The well-known Erdős–Szekeres Theorem is extended by showing that, for every fixed k ∈ N, every set of n points in the plane in general position contains a k -convex subset of size at least Ω ( log k n ) . Expand