Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1977_06_01_rodl: Rödl (Proc. Amer. Math. Soc., 1977) proves that for every k there is f(k) such that every graph of chromatic number at least f(k) contains a triangle-free subgraph of chromatic number at least k.
Linked from (1)
Graph