Journal of Pure and Applied Mathematics: Advances and ApplicationsAuthor's: Knut Dehnhardt, Heiko Harborth and Zsolt Lángi
Pages: [69] - [86]
Received Date: July 25, 2009
Submitted by:
Erdős and Szekeres [5] made the conjecture that, for any set of points in the plane, in general position, contains n points in convex position. A computer-based proof of this conjecture for appeared in [9] of Peters and Szekeres. The aim of this paper is to give a partial proof of the conjecture for without the use of computers, for the special case when the convex hull of the point set is a pentagon.
happy ending problem, Erdős-Szekeres conjecture, hexagon, convex position.
