, Volume 19, Issue 3, pp 367-371

Forced Convex n -Gons in the Plane

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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 . 26 June, 1998 Editors-in-Chief: &lsilt;a href=../edboard.html#chiefs&lsigt;Jacob E. Goodman, Richard Pollack&lsilt;/a&lsigt; 19n3p367.pdf yes no no yes

Received January 1, 1997, and in revised form June 6, 1997.