An Improved Upper Bound for the ErdAs-Szekeres Conjecture
2016
Abstract
Let ES(n) denote the minimum natural number such that every set of ES(n) points in general position in the plane contains n points in convex position. In 1935, ErdAs and Szekeres proved that ES. In 1961, they obtained the lower bound , which they conjectured to be optimal. In this paper, we prove that ES(n) <= (2n - 5 n - 2) - (2n - 8 n - 3 + 2) approximate to 7/16 (2n - 4 n - 2).
Details
Title
An Improved Upper Bound for the ErdAs-Szekeres Conjecture
Author(s)
Mojarrad, Hossein Nassajian ; Vlachos, Georgios
Published in
Discrete & Computational Geometry
Pagination
16
Volume
56
Issue
1
Pages
165-180
Date
2016
Publisher
New York, Springer
ISSN
0179-5376
Keywords
Other identifier(s)
View record in Web of Science
Laboratories
DCG
Record Appears in
Scientific production and competences > SB - School of Basic Sciences > SB Archives > DCG - Chair of Combinatorial Geometry
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Record creation date
2016-07-19