Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2003_05_01_chang: Theorem 2 of Chang (Ann. of Math. 2003) bounds the simple sums and products of a k-element integer set below by k to a power of order log k/log log k, beating every fixed power of k; credited by the site's curator and refereed.
Linked from (1)
Graph