Erdős distinct distances problem
Problem in discrete geometry
Summary
In discrete geometry, the Erdős distinct distances problem states that every set of points in the plane has a nearly-linear number of distinct distances. It was posed by Paul Erdős in 1946. The current best result was achieved by Larry Guth and Nets Katz in 2015.
Modified
5/21/2026, 4:31:21 AM
Source: WikipediaView full article↗