Erdős–Gyárfás conjecture
Encyclopedia : E : ER : ERD : 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, András Gyárfás, claims that any graph with minimum degree 3 contains a cycle whose length is a power of 2.
See also
From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.