Erdős problem 64 · problems.science

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

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:0c5cf1acb16f516d5b9005aae98896d95ad0466f9586a90e03726b3916a5310d
Metadata: sha256:0fcf5179efed2ac0899c1effce2aa6b89ae01a911f728a81ea8c18c9a440da4d
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:2921e3f8e25ff67c1cbbecd7062444f366c5f6e60d3800eb0d0c1767680e1360

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