Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1991_09_01_alon_mcdiarmid_reed: The largest acyclic chromatic number of a graph of maximum degree d lies between d^{4/3} / (log d)^{1/3} and d^{4/3}, up to constants; in particular it is o(d^2).
Linked from (1)
Graph