Discrete & Computational Geometry

, Volume 19, Issue 3, pp 367–371 | Cite as

Forced Convex n -Gons in the Plane

  • F. R. K. Chung
  • R. L. Graham


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>


General Position Seminal Paper 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer-Verlag New York Inc. 1998

Authors and Affiliations

  • F. R. K. Chung
    • 1
  • R. L. Graham
    • 2
  1. 1.University of Pennsylvania, Philadelphia, PA 19104, USA US
  2. 2.AT &T Labs—Research, Murray Hill, NJ 07974, USAUS

Personalised recommendations