Ore's theorem
theorem that a graph in which every two nonadjacent vertices have high degree sum must have a Hamiltonian cycle
Facts
7 properties- Instance of
- theorem
- Part of
- list of theorems[3]
- 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
🔗 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
0 sources
Summary
Ore's theorem is a theorem[1].