Science Fair Project Encyclopedia
Erdos-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.
See also
10-26-2009 08:16:03
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details


