The empty hexagon theorem (Q2464368)

The Empty Convex Polygon Problem of Erdös asks for the existence of a positive integer \(H(k)\) such that every set \(P\) of at least \(H(k)\) points in general position in the plane contains \(k\) points which are the vertices of a convex \(k\)-gon containing no points of \(X\) in its interior (empty convex \(k\)-gon). It is known that \(H(4)=5\) and \(H(5)=10\), whereas \(H(k)\) does not exist for \(k\geq 7\). In the paper under review the only remaining empty hexagon case is settled in the affirmative, i.e., the author gives an upper bound on \(H(6)\). This result was independently shown by T.~Gerken, in fact, with a better upper bound.