View PDF

Abstract:The no-(k+1)-in line problem seeks the maximum number of points that can be selected from an $n \times n$ square lattice such that no $k+1$ of them are collinear. The problem was first posed more than $100$ years ago for the special case $k=2$ and has remained open ever since. The general problem was recently resolved in the case $k$ is not small compared to $n$, as Kovács, Nagy and Szabó proved that the upper bound $kn$ can be attained, provided that $k>C\sqrt{n\log{n}}$ for an absolute constant $C$.
In this paper, we show that $\left(1-\tfrac{2}{k}\right)kn \leq f_k(n)\leq kn$ and $\left(1-\tfrac{3}{k}\right)kn \leq f_k(n)\leq kn$ hold for every even $k$ and odd $k$, respectively, provided that $n$ is large enough. This is asymptotically tight as $k\to \infty$. Previously, only $f_k(n)=\Omega(kn)$ was known due to Lefmann.
We present further improvements on the lower bounds for constant values of $k$ when $k<23$ holds. All these bounds are based on randomised algebraic constructions.

Submission history

From: Benedek Kovács [view email]
[v1] Mon, 11 Aug 2025 05:25:37 UTC (42 KB)
[v2] Tue, 21 Jul 2026 16:06:36 UTC (96 KB)