Erdős problem 60 · problems.science

Does every graph on $n$ vertices with $>\mathrm{ex}(n;C_4)$ edges contain $\gg n^{1/2}$ many copies of $C_4$ ?

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:0a3401037ecc5ca70e13c9a4cb7baea84cf761a8d5aa8482b1b5e13ff02c4976
Metadata: sha256:1af3dbcf001f85f4c738c9fb2392e78e9e626be24fec042e347be252677e51f8
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:7d563b6e51070974c53e7c7ba36bde2b25bd224d708c5ef6bcca4b46cdfe0733

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207