Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1984_06_01_kierstead_szemeredi_trotter: Kierstead, Szemerédi and Trotter (Combinatorica, 1984) prove that every k-chromatic graph on n vertices has an odd cycle of length O(n^(1/(k-2))); with Schrijver's graphs this answers the question for every k at least 4.
Linked from (1)
Graph