Erdős–Szekeres theorem

Known as: Erdős-Szekeres bound, Erdos-Szekeres theorem, Erdos szekeres theorem 
In mathematics, the Erdős–Szekeres theorem is a finitary result that makes precise one of the corollaries of Ramsey's theorem. While Ramsey's theorem… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2000-2016
01220002016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
The classical Erdős-Szekeres theorem states that a convex k-gon exists in every sufficiently large point set. This problem has… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
2012
2012
Let P=(p<sub>1</sub>,p<sub>2</sub>,...,p<sub>N</sub>) be a sequence of points in the plane, where p<sub>i</sub>=(x<sub>i</sub>,y… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2011
2011
According to the Erdős-Szekeres theorem, every set of n points in the plane contains roughly logn in convex position. We… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
Motivated by an open problem from graph drawing, we study several partitioning problems for line and hyperplane arrangements. We… (More)
  • figure 1
  • figure 2
Is this relevant?
2011
2011
The Erdős-Szekeres theorem states that, for every k, there is a number nk such that every set of nk points in general position in… (More)
Is this relevant?
2007
2007
Points p1, p2, . . . , pk in the plane, ordered in the x-direction, form a k-cap (k-cup, respectively) if they are in convex… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
According to the classical Erdős–Szekeres theorem, every sufficiently large set of points in general position in the plane… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2002
2002
Let k ≥ 4. A finite planar point set X is called a convex k-clustering if it is a disjoint union of k sets X1, . . . , Xk of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2000
2000
Eszter Klein’s theorem claims that among any 5 points in the plane, no three collinear, there is the vertex set of a convex… (More)
Is this relevant?