Erdős–Gyárfás conjecture

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Daniel Brockman (talk | contribs) at 08:34, 4 March 2006 (typography fix). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Jump to navigation Jump to search

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

Stub icon

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Erdős–Gyárfás_conjecture&oldid=42174179"