A note on the extensible no-three-in-line problem
arXiv:2605.07000
Abstract
We show the existence of a set avoiding collinear triples satisfying for sufficiently large . This improves on the best-known lower bound on Erde's extensible no-three-in-line problem due to Nagy, Nagy and Woodroofe by , leaving the same gap to the trivial upper bound. Our construction is random.
5 pages