Ore's theorem
Jump to navigation
Jump to search
English
[edit]Etymology
[edit]Proved in 1960 by Norwegian mathematician Øystein Ore.
Proper noun
[edit]- (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.