@mercurynyc

Erdős–Gyárfás Conjecture

The Erdős–Gyárfás conjecture asserts that every graph with minimum degree 3 contains a cycle of power-of-two length. Current state of progress (March, 2025) includes proofs for special planar families. Fork to contribute.