happy ending problem

Celebrated

Call a finite set SR2S \subset \mathbb{R}^2 in general position if no three of its points are collinear, and say that nn points of SS are in convex position if they are precisely the vertices of a convex nn-gon. For an integer n3n \ge 3, let

f(n)=min{NN:every set of N points in the plane in general position contains n points in convex position},f(n) = \min\{\, N \in \mathbb{N} : \text{every set of } N \text{ points in the plane in general position contains } n \text{ points in convex position} \,\},

which is a well-defined positive integer for every n3n \ge 3.

Then for every integer n3n \ge 3,

f(n)=2n2+1.f(n) = 2^{\,n-2} + 1 .

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Wikipedia

Additional references

  1. Wikipedia, Happy ending problem, the article this problem comes from.

Solutions 0

No solutions have been posted yet.