Exponent conjecture for k-holes avoiding a (k+1)-hole
For each fixed integer , let be the maximum number of -holes determined by a planar point set in general position of size at most and containing no -hole. A -hole is a -element subset in convex position whose convex hull contains no other point of the set.
Exponent conjecture for . For every fixed integer ,
The paper proves upper and lower bounds with exponents and , respectively, and conjectures that the true exponent is closer to the lower bound. Horton sets and grid Horton sets provide supporting examples, but the asserted upper bound remains open.
References
- Andrew Suk and Su Zhou, “On the maximum number of k-holes in point sets with no (k + 1)-hole”, arXiv:2606.05721 (2026).
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.