Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2006_11_14_bukh_sudakov: Theorem 1.1 of Bukh and Sudakov (J. Combin. Theory Ser. B 2007): a graph with no clique or independent set of C log n vertices has an induced subgraph on αn vertices with β√n distinct degrees; Problem 637, refereed.
Linked from (1)
Graph