Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2000_12_01_khalfalah_lodha_szemeredi: Khalfalah, Lodha and Szemerédi prove that a subset of the first N integers with no square among its pairwise sums has at most (11/32 + o(1))N elements, matching Massias's set; DIMACS report 2000, refereed in Discrete Math. 2002.
Linked from (1)
Graph