A note on the value about a disjoint convex partition problem

作者：You Xinshang; Wei Xianglin^*

来源：Ars Combinatoria, 2014, 115: 459-465.

Let P be a planar point set with no three points collinear. A k-hole of P is a convex k-gon H such that the vertices of H are elements of P and no element of P lies inside H. In this article, we prove that for any planar 9 points set with no three points collinear, with at least 5 vertices on the boundary of the convex hull, contains a 5-hole and a disjoint 3-hole.

• 出版日期2014-7
• 单位河北大学