← All problems

Erdős unit-distance conjecture

80 years old · traced to

Let NN points be given in the Euclidean plane, and let a unit distance mean a pair of points whose Euclidean distance is 11. The unit distance conjecture. The number of unit distances determined by any NN points in the plane is always

≲ϵN1+ϵ\lesssim_\epsilon N^{1+\epsilon}

for every ϵ>0\epsilon>0. 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
  1. If u(n) is the maximum number of unit-distance pairs among n planar points, is u(n) = n^(1+o(1))?

  2. Let P\mathcal P be a set of NN points in the Euclidean plane, and let a unit distance be a pair of points in P\mathcal P whose Euclidean distance is 11. Unit distance conjecture. The number of unit distances determined by NN points in the plane is always

    ≲ϵN1+ϵ\lesssim_\epsilon N^{1+\epsilon}

    for every ϵ>0\epsilon>0. 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
  1. Jean Bourgain and Ciprian Demeter, “The proof of the l^2 Decoupling Conjecture”, arXiv:1403.5335 (2015).

Progress summary

Refreshed
Open · solution reported

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 nn planar points satisfies u(n)=n1+o(1)u(n)=n^{1+o(1)}.

Known results

  • Erdős’s constructions gave the lower bound n1+Ω(1/log⁡log⁡n)n^{1+\Omega(1/\log\log n)}.
  • Spencer, Szemerédi, and Trotter (1984) proved the general upper bound O(n4/3)O(n^{4/3}).

May 2026 disproof

An internal OpenAI model produced an infinite family with at least n1+εn^{1+\varepsilon} unit distances for some fixed ε>0\varepsilon>0, directly contradicting the conjecture. A companion paper gives a human-digested and externally verified proof; later work reports arbitrarily large examples exceeding n1.0152n^{1.0152}.

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.