Erd?-Gy?f? conjecture

From Wacklepedia - The Free Encyclopedia

In graph theory, the unproven Erdős-Gy?f? conjecture, made by the prolific mathematician Paul Erdős and a collaborator, claims that any graph with minimum degree 3 contains a cycle whose length is a power of 2.