On an empty triangle with the maximum area in planar point sets

We deal with only finite point sets P in the plane in general position. A point set is convex or in convex position if it determines a convex polygon. A convex subset Q of P is said to be empty if no point of P lies inside the convex hull of Q. An empty convex subset of P with k elements is also called a k-hole of P