Skip to content

Erdős problem 24

Start work

Does every triangle-free graph on 5n5n vertices contain at most n5n^5 copies of C5C_5?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

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.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:cabf56bb39108826ac0c5f0d10b5b4c8c4e9df86de920d5699a6c236e06309dc
Metadata
sha256:694b27430d0c3ab998a38a168b763979da147fb22c3a0bb3747e402795fc82fd
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:3600aa591bec88b843cc46ce7b1b9dce559ce1afbc9901f5ed54fc119036314c
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON