, Volume 19, Issue 3, pp 457-459

Note on the Erdos - Szekeres Theorem

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract.

Let g(n) denote the least integer such that among any g(n) points in general position in the plane there are always n in convex position. In 1935, P. Erdős and G. Szekeres showed that g(n) exists and \(2^{n-2}+1\le g(n)\le {2n-4\choose n-2}+1\) . Recently, the upper bound has been slightly improved by Chung and Graham and by Kleitman and Pachter. In this paper we further improve the upper bound to \(g(n)\le {2n-5\choose n-2}+2.\) 26 June, 1998 Editors-in-Chief: &lsilt;a href=../edboard.html#chiefs&lsigt;Jacob E. Goodman, Richard Pollack&lsilt;/a&lsigt; 19n3p457.pdf yes no no yes

Received July 1, 1997, and in revised form July 14, 1997.