The happy ending problem ( http://en.wikipedia.org/wiki/Happy_Ending_problem ) says that any set of five points in the plane in general position has a subset of four points that form the vertices of a convex quadrilateral. More generally, Erdös and Szekeres proved that for any positive integer $N$, there is a minimal integer $f(N)$ such that any set of $f(N)$ points in the plane in general position has a subset of $N$ points that form the vertices of a convex polygon, and it is known that $f(N)$ is at least $1+2^{N-2}$.
An open question is: does $f(N)=1+2^{N-2}$ hold?
