On the existence of a convex point subset containing one triangle in the plane

Let g(k) be the smallest integer such that every planar point set in general position with at least g(k) interior points has a convex subset with precisely k interior points. In this paper, we show that g(3)=8 if the point sets have no empty convex hexagons.