Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2007_06_27_alon_sudakov: Alon and Sudakov bound f((log n)^2, n) between (log n)^2/log log n and (log n)^2 and find f((log n)^3, n) of order (log n)^2/log log n, so both displayed lower-bound proposals fail; refereed in J. Graph Theory 56 (2007).
Linked from (1)
Graph