Erdos-gyrfs Conjecture

In graph theory, the unproven Erdős-Gyrfs 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

 

<< PreviousWord BrowserNext >>
cayuse
george lewis (clarinetist)
caucasian iberia
madeleine stowe
cinema of the czech republic
thomas stanley
molly house
pops foster
judith (disambiguation)
orthodontics
ace ventura, pet detective
joachim murat
earl hines
erdos conjecture
rachel
yiftach brigade
alvar
zilpah
danny trejo
negev brigade
unregistered baptist fellowship
independent baptist fellowship international
open marriage
china news service
euronext
hans asperger
pnyx
grease (movie)
microstate (thermodynamics)
tyson
ahmed yusuf nuristani
grote reber
kinyarwanda language
filariasis
sertindole
bongzilla
e 6 process
bolivian gas war
ankle
teotihuacan spider woman
robert ward
plan colombia
function approximation
josiah bartlet
Copyright 2005-2009 OnPedia.com. All Rights Reserved