FAQ

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

Related topics

Related topics

3 relations
Longest increasing subsequencePermutation patternRamsey's theorem

Related mentions per year

Related mentions per year

1956-2018
1960198020002020
Erdős–Szekeres theorem
Ramsey's theorem
Permutation pattern
Longest increasing subsequence

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Two player game variant of the Erdos-Szekeres problem
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
Higher-order Erdos-Szekeres theorems
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
Erdős–szekeres Theorem with Forbidden Order Types. Ii
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
A center transversal theorem for hyperplanes and applications to graph drawing
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
Erdős-Szekeres and Testing Weak epsilon-Nets are NP-hard in 3 dimensions - and what now?
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
Open Caps and Cups in Planar Point Sets
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
Erdos-Szekeres theorem with forbidden order types
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?
2006
2006
On the positive fraction Erdos-Szekeres theorem for convex sets
 
Is this relevant?
2002
2002
The Partitioned Version of the Erdös - Szekeres Theorem
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
Problems and Results around the Erdös-Szekeres Convex Polygon Theorem
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?