Almost empty hexagons

In this work, new nontrivial bounds are obtained for the minimum number of points in general position on the plane, among which one certainly finds the set of vertices of a convex hexagon with not more than one point of the initial set inside. UDC 519.154+519.146
1.Introduction and Result Formulation In 1935, P. Erdos and G. Szekeres formulated the following problem (see [2,3]). First ErdoSzekeres problem. To find for each integer n ≥ 3 the minimum [...]