In mathematics, in the area of discrete geometry, the no-three-in-line problem asks for the maximum number of points that can be placed in the n × n grid so that no three points are collinear. This number is at most 2n, since if 2n + 1 points are placed in the grid, then by the pigeonhole principle some row and some column will contain three points. The problem was introduced by Henry Dudeney in 1917. Although the problem can be solved with 2n points for every nup to 46, it is conjectured that fewer than 2n points are possible for sufficiently large values of n. The best solutions that are known to work for arbitrarily large values of n place slightly fewer than 3n/2 points.
observed that, when n is a prime number, the set of n grid points, for 0 ≤ i < n, contains no three collinear points. When n is not prime, one can perform this construction for a p × p grid contained in the n × n grid, where p is the largest prime that is at most n. As a consequence, for any ε and any sufficiently large n, one can place points in the n × n grid with no three points collinear. Erdős' bound has been improved subsequently: show that, when n/2 is prime, one can obtain a solution with 3/2 points by placing points on the hyperbolaxy ≡ k, where k may be chosen arbitrarily as long as it is nonzero mod n/2. Again, for arbitrary n one can perform this construction for a prime near n/2 to obtain a solution with points.
conjectured that for large n one cannot do better than c n with noted that Gabor Ellmann found, in March 2004, an error in the original paper of Guy and Kelly's heuristic reasoning, which if corrected, results in
Applications
The Heilbronn triangle problem asks for the placement of n points in a unit square that maximizes the area of the smallest triangle formed by three of the points. By applying Erdős' construction of a set of grid points with no three collinear points, one can find a placement in which the smallest triangle has area
Non-collinear sets of points in the three-dimensional grid were considered by. They proved that the maximum number of points in the n × n × n grid with no three points collinear is. Similarly to Erdős's 2D construction, this can be accomplished by using points mod p, where p is a prime congruent to 3 mod 4. Another analogue in higher dimensions is to find sets of points that do not all lie in the same plane. For the no-four-coplanar problem in three dimensions, it was reported by Ed Pegg, Oleg567 et al, that 8 such points can be selected in a 3x3x3 grid, 10 such points can be found for 4x4x4, and 13 such points can be found for 5x5x5., it is not known what the maximal solution is for 6x6x6 grid, nor how many such solutions exist. Similar to the 2nupper bound for the 2D case, there exists a 3n upper bound for the 3D case, though as seen above, not all values of n attain the upper bound. The cap set problem concerns a similar problem in high-dimensional vector spaces over finite fields.
Graph generalizations
A noncollinear placement of n points can also be interpreted as a graph drawing of the complete graph in such a way that, although edges cross, no edge passes through a vertex. Erdős' construction above can be generalized to show that every n-vertex k-colorable graph has such a drawing in a O × O grid. One can also consider graph drawings in the three-dimensional grid. Here the non-collinearity condition means that a vertex should not lie on a non-adjacent edge, but it is normal to work with the stronger requirement that no two edges cross.
Small values of ''n''
For n ≤ 46, it is known that 2n points may be placed with no three in a line. The numbers of solutions for small n = 2, 3,..., are
