Ore's theorem
Ore's theorem is a theorem that a graph in which every two nonadjacent vertices have high degree sum must have a Hamiltonian cycle.
All 2 facts, and where they come from
Facts
2 facts · 0 confirmed by two sources · 0 cited · 2 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 18, 2026 · revision 2482364782
- Described as
- theorem that a graph in which every two nonadjacent vertices have high degree sum must have a Hamiltonian cycle
- What it is
- theorem
- Named after
- Øystein Ore
- Wikipedias with a page
- 13
Wikidata item Q225973 (wikidata.org/wiki/Q225973), public domain (CC0). Copied 2026-11-18.
What Wikipedia says · copied November 18, 2026 · revision 1308502590
Ore's theorem is a result in graph theory proved in 1960 by Norwegian mathematician Øystein Ore. It gives a sufficient condition for a graph to be Hamiltonian, essentially stating that a graph with sufficiently many edges must contain a Hamilton cycle. Specifically, the theorem 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.
From the Wikipedia article “Ore's theorem” (en.wikipedia.org/wiki/Ore's_theorem), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-18; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
