A note on the upper bound for disjoint convex partitions

A Note on the Minimum Size of a Point Set Containing Three Nonintersecting Empty Convex Polygons

“…We showed n(3, 3, 5) = 12 in [17]. We have proved that n(3, 3, 5) = 12 [17], n(4, 4, 5) ≤ 16 [18] and also discuss a disjoint holes problem in preference [19]. In this paper, we will continue discussing this problem and prove that n(3, 4, 5) = 13.…”