Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2011_07_11_fox_lee_sudakov: Fox, Lee and Sudakov prove that the chromatic number of every n-vertex graph is at most an absolute constant times n^{1/2}/log n times the order of its largest clique subdivision, which answers Problem 717 affirmatively.
Linked from (1)
Graph