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.