arXiv:math/0611802 [math.CO]AbstractReferencesReviewsResources
An order-refined and generalized version of the Erdos-Szekeres theorem on convex polygons
Published 2006-11-27Version 1
The Erdos-Szekeres theorem states that for any natural k there is a natural number g(k) such that any set of at least g(k) points on a plane in general position contains a set of k points that are the extreme points of a convex polytope. We generalize and refine this theorem, having the general-position condition removed and a convex polygon defined as an ordered sequence of points such that the union of the edges of the polygon coincides with the boundary of its convex hull.
Comments: 5 pages
Related articles: Most relevant | Search more
arXiv:2010.11100 [math.CO] (Published 2020-10-21)
Extremal problems for pairs of triangles in a convex polygon
arXiv:1711.04504 [math.CO] (Published 2017-11-13)
Tilings with noncongruent triangles
arXiv:1012.3654 [math.CO] (Published 2010-12-16)
Generalized Compositions of Natural Numbers