A note on the value in the disjoint convex partition problem (Q1991778)

Let \(P\) denote a planar point set with no 3 points collinear. Some \(k\) points of \(P\) are said to form a \(k\)-hole, if they make the \(k\) vertices of a convex polygon, and the interior of this convex polygon contains no point from \(P\). A separating line of \(P\) is a line, that separates a 4-hole of \(P\) from the remaining points of \(P\). The paper under review shows that if \(P\) has at least 13 points and has a separating line, then \(P\) contains pairwise disjoint 3-, 4-, and 5-holes.