Formal Statement
Let G be a (finite and simple) graph with n ≥ 3 vertices. We denote by deg v the degree of a vertex v in G, i.e. the number of incident edges in G to v. Then, Ore's theorem states that if
- deg v + deg w ≥ n for every pair of non-adjacent vertices v and w of G (*)
then G is Hamiltonian.
Read more about this topic: Ore's Theorem
Famous quotes containing the words formal and/or statement:
“The formal Washington dinner party has all the spontaneity of a Japanese imperial funeral.”
—Simon Hoggart (b. 1946)
“He that writes to himself writes to an eternal public. That statement only is fit to be made public, which you have come at in attempting to satisfy your own curiosity.”
—Ralph Waldo Emerson (1803–1882)