In 2016, Andrew Suk (nearly) solved the "happy ending" problem; that is, he proved that $2^{n+o(n)}$ points in general position guarantee the existence of $n$ points in convex position which improves the upper bound of $4^{n-o(n)}$ given by Erd\H{o}s and Szekeres in 1935 and nearly matches the lower bound of $2^{n-2}+1$ given by Erd\H{o}s and Szekeres in 1960 which they conjectured to be optimal.

In 2016, Andrew Suk (nearly) solved the "happy ending" problem; that is, he proved (On the Erdős-Szekeres convex polygon problem, J. Amer. Math. Soc. 30 (2017), 1047-1053, doi:10.1090/jams/869, arXiv:1604.08657) that $2^{n+o(n)}$ points in general position guarantee the existence of $n$ points in convex position which improves the upper bound of $4^{n-o(n)}$ given by Erdős and Szekeres in 1935 and nearly matches the lower bound of $2^{n-2}+1$ given by Erdős and Szekeres in 1960 which they conjectured to be optimal.