Name
Abstract | ||
|---|---|---|
. Let g(n) denote the least value such that any g(n) points in the plane in general position contain the vertices of a convex n -gon. In 1935, Erdős and Szekeres showed that g(n) exists, and they obtained the bounds Chung and Graham have recently improved the upper bound by 1; the first improvement since the original Erdős—Szekeres paper.
We show that
26 June, 1998
Editors-in-Chief: &lsilt;a href=../edboard.html#chiefs&lsigt;Jacob E. Goodman, Richard Pollack&lsilt;/a&lsigt;
19n3p405.pdf
yes
no
no
yes |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1007/PL00009358 | Discrete & Computational Geometry |
Keywords | Field | DocType |
upper bound,convex set | Combinatorics,General position,Vertex (geometry),Upper and lower bounds,Regular polygon,Mathematics | Journal |
Volume | Issue | ISSN |
19 | 3 | 0179-5376 |
Citations | PageRank | References |
7 | 1.44 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel J. Kleitman | 1 | 854 | 277.98 |
| Lior Pachter | 2 | 1026 | 121.08 |