FORCED CONVEX N-GONS IN THE PLANE

Authors
CHUNG FRK GRAHAM RL
Citation
Frk. Chung et Rl. Graham, FORCED CONVEX N-GONS IN THE PLANE, Discrete & computational geometry, 19(3), 1998, pp. 367-371
Citations number
3
Categorie Soggetti
Computer Science Theory & Methods",Mathematics,"Computer Science Theory & Methods",Mathematics
Journal title
Discrete & computational geometry → ACNP
ISSN journal
01795376
Volume
19
Issue
3
Year of publication
1998
Pages
367 - 371
Database
ISI
SICI code
0179-5376(1998)19:3<367:FCNITP>2.0.ZU;2-H
Abstract
In a seminal paper from 1935, Erdos 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 [GRAPHICS] whic h have stood unchanged since then. In this paper we remove the +1 from the upper bound for n greater than or equal to 4.