The extensible No-Three-In-Line problem

Dániel T. Nagy, Zoltán Lóránt Nagy, Russ Woodroofe

The classical No-Three-In-Line problem seeks the maximum number of points that may be selected from an $n\times n$ grid while avoiding a collinear triple. The maximum is well known…