On the minimum size of a point set containing a 5-hole and double disjoint 3-holes
Xinshang You, Xiang Lin Wei · Mathematical Notes · 2015
Let n ( k , l , m ), k ≤ l ≤ m , be the smallest integer such that any finite planar point set of at least n ( k , l , m ) points in general position, contains an empty convex k -hole; an empty convex l -hole and an empty convex m -hole, which are all pairwise disjoint. In this paper we prove that n (3, 3, 5) = 12.