Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2024_09_02_tao: Tao constructs, for every large n, n plane points in which every four determine at least five distinct distances while the whole set determines O(n^2 / sqrt(log n)) distances, so the answer is no; refereed in DCG.
Linked from (1)
Graph