Skip to content

Erdős problem 64

Start work

Does every finite graph with minimum degree at least 33 contain a cycle of length 2k2^k for some k≥2k \geq 2?

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:0c5cf1acb16f516d5b9005aae98896d95ad0466f9586a90e03726b3916a5310d
Metadata
sha256:0fcf5179efed2ac0899c1effce2aa6b89ae01a911f728a81ea8c18c9a440da4d
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:2921e3f8e25ff67c1cbbecd7062444f366c5f6e60d3800eb0d0c1767680e1360
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON