Ore's theorem
Sign in to savetheorem that a graph in which every two nonadjacent vertices have high degree sum must have a Hamiltonian cycle
In the Vinony graph
Within Vinony's link graph, Ore's theorem is referenced by 7 other articles, and connects out to Hamiltonian path, glossary of graph theory terms and Norway.
Vinony files it under Extremal graph theory, Hamiltonian paths and cycles and Theorems in graph theory.
Its subject is documented across 13 Wikipedia language editions.
Wikidata facts
- Instance of
- theorem
- Part of
- list of theorems
- Named after
- Øystein Ore
Show 4 more facts
- maintained by WikiProject
- WikiProject Mathematics
- studied by
- graph theory
- proved by
- Øystein Ore
- statement describes
- Hamiltonian graph
Sources (1)
via Wikidata · CC0
Connections
Hamiltonian path
Entity
glossary of graph theory terms
Entity
Norway
Country
digital object identifier
Entity
graph theory
Entity
graph
Entity
JSTOR
Organization
complete graph
Entity
node
Entity
directed graph
Entity
degree
Entity
regular graph
Entity
Mathematical Reviews
Entity
Øystein Ore
Entity
complete bipartite graph
Entity
strongly connected component
Entity
American Mathematical Monthly
Entity
pancyclic graph
Entity
Journal of Combinatorial Theory
Entity
Ore condition
Entity