Erdős problem 24 · problems.science

Does every triangle-free graph on $5n$ vertices contain at most $n^5$ copies of $C_5$ ?

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:cabf56bb39108826ac0c5f0d10b5b4c8c4e9df86de920d5699a6c236e06309dc
Metadata: sha256:694b27430d0c3ab998a38a168b763979da147fb22c3a0bb3747e402795fc82fd
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:3600aa591bec88b843cc46ce7b1b9dce559ce1afbc9901f5ed54fc119036314c

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