Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2018_02_18_alon_ruzsa_solymosi: Alon, Ruzsa and Solymosi (Publ. Mat. 2020) construct, for every c in (0, 1), sets of n integers with graphs of order n^{1+c} edges whose edge sums and products number at most n^{1+c-delta}; refereed and site-credited.
Linked from (1)
Graph