Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2024_07_01_bhowmick: For every n, a set of n points in the plane in which floor(n/4) distinct distances each occur for at least n+1 pairs, so the answer is yes; the proof is formalized in Lean by Aristotle, which the corpus has not built.
Linked from (1)
Graph