Talk:No-three-in-line problem

"In 1951, Paul Erdős proved the answer." Well, what is the answer? This is very irritating. N Shar 01:23, 12 January 2006 (UTC)

{{Talk:No-three-in-line problem/GA1}}

{{Template:Did you know nominations/No-three-in-line problem}}

The example refers to a grid with 10 lines each way as a 10x10 grid. I would guess most people define a Sudoku "box" or a tic-tac-toe game in an outline as a 3x3 grid, yet they are composed of 4 lines each way. Is it standard to define a grid by the number of lines each way or by the number of pigeonholes created? Also, the pawns-on-a-chessboard problem obviously counts pigeonholes rather than intersections. Just wondering . . .Charles Fee (talk) 04:38, 31 January 2022 (UTC)

:It's standard, for mathematical treatments of this problem, to give the grid size as the number of positions available for points in each direction, and to put those points on integer coordinates (at the crossings of integer grid lines) rather than at half-integer coordinates (at the center points of grid squares). That is different from the original formulation of the problem, where the points (chess pawns) were placed at centers of chess squares, but it doesn't make any difference to the results for the problem. —David Eppstein (talk) 06:58, 31 January 2022 (UTC)

This problem of maximizing the size of a set such that no $k$ members have sone common property for some small $k$ sounds connected to Ramsey theory, should there be a link to Ramsey theory in a "See also" page? C7XWiki (talk) 01:46, 12 August 2022 (UTC)