{"schema":"vela.problem-packet.v0.1","problem":60,"statement":"Does every graph on $n$ vertices with $>\\mathrm{ex}(n;C_4)$ edges contain $\\gg n^{1/2}$ many copies of $C_4$?","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A006855","name":"Maximum number of edges in an n-node squarefree graph, or, in a graph containing no 4-cycle, or no C_4.","terms":"0,1,3,4,6,7,9,11,13,16,18,21,24,27,30,33,36,39,42,46,50,52,56,59,63,67,71,76,80,85,90,92,96,102,106,110,113,117,122,127","url":"https://oeis.org/A006855"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}