Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2007_09_17_alon: Alon's Proposition 2.1: for every D > 1 and large n a graph with at least n log n edges whose m-vertex subgraphs of average degree d and maximum degree at most Dd have d = O(√log m + log D), a negative answer; refereed in 2008.
Linked from (1)
Graph