{"schema":"vela.problem-packet.v0.1","problem":85,"statement":"Let $n\\geq 4$ and $f(n)$ be minimal such that every graph on $n$ vertices with minimal degree $\\geq f(n)$ contains a $C_4$. Is it true that, for all large $n$, $f(n+1)\\geq f(n)$?","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[{"id":"att_ca4cb785895be3d7","kind":"dead_end","claim":"attempted via frontier '?' (transfer_strength=n/a) -> no_progress","grade":"honest_null","gateStatus":"needs_verification","superseded":false}],"velaLean":[],"oeis":[{"id":"A006672","name":"a(n) = smallest m such that for every red-blue edge-coloring of the graph K_{m} there exists either a red 4-cycle or a blue K_{1,n}; Ramsey number r(C_4, K_{1,n}).","terms":"4,4,6,7,8,9,11,12,13,14","url":"https://oeis.org/A006672"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}