Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1971_01_01_erdos_spencer: Erdős and Spencer's Theorem (5) (Networks, 1972) gives the unordered-edge minimax H(n) the order n^(3/2) for all large n, the refereed resolution of the question as the historical papers and the site intend it.
Linked from (1)
Graph