Erdős Problem #838 — Let be maximal such that any points in , with no three on a line, determine at least different convex subsets.
Let be maximal such that any points in , with no three on a line, determine at least different convex subsets. Estimate - in particular, does there exist a constant such that
References
Primary source
Additional references
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
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.