Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1963_02_01_altman: The vertices of a convex n-gon in the plane determine at least the floor of n/2 distinct distances, sharp for the regular polygon; Erdős's conjecture, proved in the Monthly in 1963, credited by the site, with a Lean file linked.
Linked from (1)
Graph