Erdős unit-distance conjecture
Let points be given in the Euclidean plane, and let a unit distance mean a pair of points whose Euclidean distance is . The unit distance conjecture. The number of unit distances determined by any points in the plane is always
for every . This is an incidence-geometric conjecture related to replacing lines by circles in point-line incidence estimates; the source states it as an open conjecture and gives no resolution.
Equivalent formulations
If u(n) is the maximum number of unit-distance pairs among n planar points, is u(n) = n^(1+o(1))?
Let be a set of points in the Euclidean plane, and let a unit distance be a pair of points in whose Euclidean distance is . Unit distance conjecture. The number of unit distances determined by points in the plane is always
for every . This is introduced in the context of incidence bounds, where analogous estimates for point–circle incidences are discussed; the source gives no resolution of the conjecture.
source: Ciprian Demeter, “Incidence theory and restriction estimates”, arXiv:1401.1873 (2014).
References
- Jean Bourgain and Ciprian Demeter, “The proof of the l^2 Decoupling Conjecture”, arXiv:1403.5335 (2015).
Progress summary
A 2026 construction shows that planar point sets can have substantially more unit-distance pairs than the conjecture allowed, so the conjecture is false.
Paul Erdős posed the problem in 1946: whether the maximum number of unit-distance pairs among planar points satisfies .
Known results
- Erdős’s constructions gave the lower bound .
- Spencer, Szemerédi, and Trotter (1984) proved the general upper bound .
May 2026 disproof
An internal OpenAI model produced an infinite family with at least unit distances for some fixed , directly contradicting the conjecture. A companion paper gives a human-digested and externally verified proof; later work reports arbitrarily large examples exceeding .
Current status (as of July 2026): The conjecture is disproved by a corroborated companion paper, while quantitative improvements to the exponent continue.
Sources
Solutions 0
No solutions have been posted yet.