# Ore's theorem

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

**Wikidata**: [Q225973](https://www.wikidata.org/wiki/Q225973)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Ore's_theorem)  
**Source**: https://4ort.xyz/entity/ore-s-theorem


## References

1. Freebase Data Dumps. 2013