A note on the extensible no-three-in-line problem
Combinatorics
2026-05-11 v1
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.
Cite
@article{arxiv.2605.07000,
title = {A note on the extensible no-three-in-line problem},
author = {Anubhab Ghosal},
journal= {arXiv preprint arXiv:2605.07000},
year = {2026}
}
Comments
5 pages