Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2010_11_17_guth_katz: Guth and Katz bound the number of ordered quadruples of n plane points with |p1 - p2| = |p3 - p4| > 0 by O(n^3 log n); that count is four times the sum of squared distance multiplicities, which is O(n^(3 + eps)).
Linked from (1)
Graph