Erdős Problem #216 — Existence of empty convex polygons

About 45 years old · traced to

For each kk, does there exist g(k)g(k) such that every set of g(k)g(k) planar points in general position contains kk points in convex position whose convex hull contains no other point of the set? If so, estimate g(k)g(k).

References

Additional references

P. Erdős, On the combinatorial problems which I would most like to see solved, Combinatorica 1 (1981), 25–42.

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.