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
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