Matches in DBpedia 2014 for { ?s ?p In graph theory, the unproven Erdős–Gyárfás conjecture, made in 1995 by the prolific mathematician Paul Erdős and his collaborator András Gyárfás, states that every graph with minimum degree 3 contains a simple cycle whose length is a power of two.. }
Showing items 1 to 1 of
1
with 100 items per page.