摘要
Let g(n) denote the least integer such that among any g(n) points in general position in the plane there are always n points in convex position. In this paper we show that g(n)≤(2n-5 , n-2)+2 by a new method.
Let g(n) denote the least integer such that among any g(n) points in general position in the plane there are always n points in convex position. In this paper we show that g(n)≤(2n-5 , n-2)+2 by a new method.
基金
The NSF (199174) of Hebei Province
