Abstract.
In a seminal paper from 1935, Erdős and Szekeres showed that for each n there exists a least value g(n) such that any subset of g(n) points in the plane in general position must always contain the vertices of a convex n -gon. In particular, they obtained the bounds \(2^{n-2} + 1 \le g(n) \le {{2n-4}\choose{n-2}} +1,\) which have stood unchanged since then. In this paper we remove the +1 from the upper bound for n ≥ 4 . <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>19n3p367.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 January 1, 1997, and in revised form June 6, 1997.
Rights and permissions
About this article
Cite this article
Chung, F., Graham, R. Forced Convex n -Gons in the Plane . Discrete Comput Geom 19, 367–371 (1998). https://doi.org/10.1007/PL00009353
Issue Date:
DOI: https://doi.org/10.1007/PL00009353