On the Erdős-Szekeres convex polygon problem

On the Erdős-Szekeres convex polygon problem
Andreas Holmsen
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:

This entry was posted on Wednesday, May 25th, 2016 at 5:14 pm and is filed under 2016, KAIST Discrete Math Seminar. You can follow any responses to this entry through the RSS 2.0 feed. Both comments and pings are currently closed.

Comments are closed.