A Note on the Value in the Disjoint Convex Partition Problem

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

“…From [20], we know that 13 ≤ n(3, 4, 5) ≤ 14. In this note we will give the exact value of n (3,4,5), that is the following theorem.…”

“…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.…”