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

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