OPENHARDgraph theoryextremal graph theory
Does every finite graph with minimum degree at least 3 contain a cycle of length $2^k$ for some $k\geq 2$?
Notes: Conjectured by Erdos and Gyarfas. Liu and Montgomery proved it for sufficiently large minimum degree, disproving a stronger conjecture. The small-degree case remains open.
AI Status: NONE · 0 total attempts