Form a family of sets of points, as follows.
When or , then and there is only one point.
For any other choice of , place the points for below and to the left of the points for , to form a single chain of points that is monotone in both their and coordinates. When placing these two subsets of points, use more space between them horizontally than vertically, so that all lines through pairs of points on the left side pass above the right side and all lines through pairs of points on the right side pass below the left side.
This construction can be used to generate point sets with no large convex subsets. To see this, it’s easier to start with two restricted types of convex subset, called “cups” and “caps”. A cup is a subset of points that lies on the graph of a convex function, and a cap lies on the graph of a concave function. These are both convex subsets, but not all convex subsets are cups or caps. For instance, in the image above, the sets in the positions of the binomial coefficients are cups and the sets in the positions of are caps.
Then it turns out that the point set in position contains neither an -cap nor an -cup. For or , this is easy to see directly: it doesn’t have enough points. For the other positions, the left side has no -cap (by induction) so an -cap would have to include at least two points of the right side, only possible if the cap is entirely on the right side. But the right side has no -cap (by induction again), so the whole point set also has no such cap. The argument for cups is symmetric.
There’s also no convex subset of points within any of these sets. For, to make such a set, you would have to combine a cap on the left with a cup on the right, and the number of points you can get that way is too small.
But we can combine these sets to get even larger sets with no large convex polygons. Take each row of this triangle, and glue its point sets together in left-to-right order, again making the horizontal spacing wide enough that in each gluing step the lines through pairs on the left pass above the right and the lines through pairs on the right pass below the left:
What convex subsets do these point sets have? We already know that within each of the subconfigurations of points there are no convex -gons, so any larger convex polygon would have to combine points from two or more of these subconfigurations. But the best you can do is to take a cap from any one subconfiguration, a cup from another subconfiguration to its right, and single points from the subconfigurations between them. In all cases, this produces at most points.
Therefore, we have found point sets with
points, having no convex -gons. According to the conjectured solution to the happy ending problem, every larger point set does have a convex -gon, so (if the conjecture is true) this is the optimal construction for avoiding convex polygons using as many points as possible.
Some bibliographic notes: The number of points in these configurations was already suggested as a conjecture in the original 1935 paper on the happy ending problem by Erdős and Szekeres, hinting that they might have already known of a construction like this one, but they didn’t actually publish such a construction until 1961. Unfortunately, the copy of their 1961 paper on the Erdős publication archive is missing the pages describing the construction, so I’m not sure how they did it. I finally found a description in a 2000 survey by W. Morris and V. Soltan. Morris and Soltan cite a 1995 paper by Kalbfleisch and Stanton that corrects “some inaccuracies in the proof” of Erdős and Szekeres; they follow the presentation of the Erdős–Szekeres construction from a 1979 book of Lovász. The construction here is based on the one from Morris and Soltan, but with a couple of minor changes, namely the arrangement of the point sets into a triangle and the use of the same gluing technique for both phases of the construction.