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.\) <lsiheader> <onlinepub>26 June, 1998 <editor>Editors-in-Chief: &lsilt;a href=../edboard.html#chiefs&lsigt;Jacob E. Goodman, Richard Pollack&lsilt;/a&lsigt; <pdfname>19n3p457.pdf <pdfexist>yes <htmlexist>no <htmlfexist>no <texexist>yes <sectionname> </lsiheader>
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received July 1, 1997, and in revised form July 14, 1997.
Rights and permissions
About this article
Cite this article
Tóth, G., Valtr, P. Note on the Erdos - Szekeres Theorem . Discrete Comput Geom 19, 457–459 (1998). https://doi.org/10.1007/PL00009363
Issue Date:
DOI: https://doi.org/10.1007/PL00009363