Erdős Problem #64 — Cycles of Power-of-Two Length

Every finite simple graph $G=(V,E)$ with minimum degree at least $3$ contains a cycle of length $2^k$ for some natural number $k$ with $k\geq 2$.