Ore's theorem

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

English Wikipedia has an article on:
Wikipedia

Etymology[edit]

Proved in 1960 by Norwegian mathematician Øystein Ore.

Proper noun[edit]

Ore's theorem

  1. (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[edit]