Ore's theorem

theorem that a graph in which every two nonadjacent vertices have high degree sum must have a Hamiltonian cycle
Intangible Theorem Q225973

Facts

7 properties
Instance of
theorem
Generalization of
Dirac's theorem[8]
Named after
Øystein Ore[2]
Proved by
Øystein Ore (1960)[4]
Statement describes
Hamiltonian graph[5]
Studied by
graph theory[6]
🏷️ Also known as
en Ore's theorem ar نظرية أور de Satz von Ore fr théorème d'Ore he משפט אור hu Ore-tétel it teorema di Ore ja オーレの定理 nl stelling van Ore pl Twierdzenie Orego pt teorema de Ore ru теорема Оре tr Ore teoremi zh 奥尔定理
🔖 Identifiers · 2
Freebase ID
/m/08rfsf
Microsoft Academic ID (discontinued)
2777942178

Report an error or request removal Lineage (PROV-JSON)

🔗 Connections
Created notable works 1
Instance of 1
Maintained by WikiProject 1
Named after 1
Part of 1
Proved by 1
Statement describes 1
Studied by 1
Press Enter · cited answer in seconds

Summary

Ore's theorem is a theorem[1].

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Ore's theorem. Retrieved November 19, 2026, from https://4ort.xyz/entity/ore-s-theorem
MLA “Ore's theorem.” 4ort.xyz Knowledge Graph, 4ort.xyz, 19 Nov. 2026, https://4ort.xyz/entity/ore-s-theorem.
BibTeX @misc{4ortxyz_ore-s-theorem_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Ore's theorem}}, year = {2026}, url = {https://4ort.xyz/entity/ore-s-theorem}, note = {Accessed: 2026-11-19}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Ore's theorem — https://4ort.xyz/entity/ore-s-theorem (retrieved 2026-11-19)

Canonical URL: https://4ort.xyz/entity/ore-s-theorem · Last refreshed: