info prev up next book cdrom email home

Ore's Theorem

If a Graph $G$ has $n\geq 3$ Vertices such that every pair of the $n$ Vertices which are not joined by an Edge has a sum of Valences which is $\geq n$, then $G$ is Hamiltonian.

See also Hamiltonian Graph

© 1996-9 Eric W. Weisstein