Unit Distance Problems
Abstract
We study some discrete and continuous variants of the following problem of Erdos: given a finite subset P of R2 or R3, what is the maximum number of pairs (p1,p2) with p1,p2 in P and |p1 -p2 |=1?
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.