Main Page
|
See live article
|
Alphabetical index
Erdös-Gyárfás conjecture
In
graph theory
, the unproven
Erdős-Gyárfás 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.