Monochromatic no-three-in-line asymptotics
Monochromatic no-three-in-line asymptotics
Let denote the exact maximum number of points in a monochromatic no-three-in-line configuration on the checkerboard grid of side length , and let be the middle real root of
Monochromatic NTIL asymptotics. The exact monochromatic no-three-in-line maxima satisfy
This is stronger than the corresponding relaxation asymptotics: the finite LP computations motivate it, while the continuum certificate gives an exact upper bound only for the odd-fat relaxation. The discrete limit remains unproved.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Thomas Prellberg, “No-three-in-line sets on the checkerboard grid”, arXiv:2605.09215 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.