Let g(n) denote the least integer such that among any g(n) points in g
eneral position in the plane there are always n in convex position. In
1935, P. Erdos and G. Szekeres showed that g(n) exists and [GRAPHICS]
Recently, the upper bounds has been slightly improved by Chung and Gr
aham and by Kleitman and Pachter. In this paper we further improve the
upper bound to [GRAPHICS]