a combinatorial problem in geometry - renyi.hu.pdfVIP

A Combinatorial Problem in Geometry by P. Erdiis and G. Szekeres Manchester Our present, problem has been suggested by Miss Esther Klein in connection with the following proposition. From 5 points of the plane of which no three lie on the same straight line it is always possible to select 4 points determining a convex quadrilateral. We present E. Klein’s proof here because later on we are going to make use of it. If the least convex polygon which en- closes the points is a quadrilateral or a pentagon the theorem is trivial. Let therefore the enclosing polygon be a triangle ABC. Then the two remaining points D and E are inside ABC. Two of the given points (say A and C) must lie on the same side of the connecting straight line DE. Then it is clear that A EDC is a convex quadrilateral. Miss Klein suggested the following more general problem. Can we find for a given n a number N(n) such that from any set con- tainin.g at least N points it is possible to select n points forming a convex polygon? There are two particular questions: (1) does the number N corresponding to n exist? (2) If so, how is the least N(n) deter- mined as a function of n? (We denote the least N by N,(n).) We give two proofs that the first question is to be answered in t