OpenAI Disproves Erdős Unit Distance Conjecture (opens in new tab)

The Erdős unit distance problem asks for the largest possible number u(n) of unit distances among n points in the plane. This is equivalent to finding maximally dense unit-distance graphs. A recent OpenAI announcement concerns the asymptotic problem: the old n^(1+o(1)) expectation is false.