On the Erdős-Szekeres convex polygon problem

Andreas Holmsen

Department of Mathematical Sciences, KAIST

Department of Mathematical Sciences, KAIST

2016/05/27 4PM (Room 2411 of Bldg E6-1)

Very recently, Andrew Suk made a major breakthrough on the Erdos-Szekeres convex polygon problem, in which he solves asymptotically this 80 year old problem of

*determining the minimum number of points in the plane in general position that always guarantees n points in convex position*. I will review his proof in full detail.Tags: AndreasHolmsen