Unit distance problems

Daniel Oberlin, Richard Oberlin

We study some discrete and continuous variants of the following problem of Erdos: given a finite subset P of R² or R³, what is the maximum number of pairs (p₁, p₂) with p₁, p₂ in P and |p₁-p₂| = 1 ?