the classic 1935 paper of erdos and szekeres entitled ``a combinatorial problem in geometry" was a starting point of a very rich discipline within combinatorics: ramsey theory. in that paper, erdos and szekeres studied the following geometric problem. for every integer $n \geq 3$, determine the smallest integer $es(n)$ such that any set of $es(n)$ points in the plane in general position contains n members in convex position, that is, n points that form the vertex set of a convex polygon. their main result showed that $es(n) \leq {2n - 4\choose n-2} + 1 = 4^{n -o(n)}$. in 1960, they showed that $es(n) \geq 2^{n-2} + 1$ and conjectured this to be optimal. despite the efforts of many researchers, no improvement in the order of magnitude has been made on the upper bound over the last 81 years. in this talk, we will sketch a proof showing that $es(n) =2^{n +o(n)}$.