A subset of a finite set of points in the plane is called an empty convex polygon or a hole if it forms the set of vertices of a convex polygon whose interior contains no points of the set. Let  be the smallest integer such that any set of  points in the plane, no three collinear, contains a k-hole, an l-hole and an s-hole, whose convex hulls are disjoint. In this paper, we show that  

convex hull, convex polygon, empty convex polygon, disjoint, hole.