Top Qs
Timeline
Chat
Perspective
Ore's theorem
From Wiktionary, the free dictionary
Remove ads
English
Etymology
Proved in 1960 by Norwegian mathematician Øystein Ore.
Proper noun
- (graph theory) A theorem that considers the sum of the degrees of pairs of non-adjacent vertices: if every such pair has a sum that at least equals the total number of vertices in the graph, then the graph is Hamiltonian.
Related terms
- Ore condition
Remove ads
Wikiwand - on
Seamless Wikipedia browsing. On steroids.
Remove ads