An Improved Upper Bound for the Erdős-Szekeres Conjecture
Let ES(n) denote the minimum natural number such that every set of ES(n) points in general position in the plane contains n points in convex position. In 1935, Erdős and Szekeres proved that ES(n)≤(2n−4n−2)+1. In 1961, they obtained the lower bound 2n−2+1≤ES(n), which they conjectured to be optimal...
| Main Authors: | , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Springer US,
2017-06-23T16:05:16Z.
|
| Subjects: | |
| Online Access: | Get fulltext |