Erdős–Gyárfás conjecture (statement)

Conjecture (1995). Every graph with minimum degree $\ge3$ contains a cycle whose length is a power of $2$.

Partial results. Verified for planar graphs, bipartite graphs, and large graphs.

Conclusion. It remains open and is a classic problem in extremal graph theory.