# Ore’s theorem

Let $G$ be a simple graph of order $n\geq 3$ such that, for every pair of distinct non adjacent vertices $u$ and $v$, $\deg(u)+\deg(v)\geq n$. Then $G$ is a Hamiltonian graph.

Title Ore’s theorem OresTheorem 2013-03-22 11:52:40 2013-03-22 11:52:40 Koro (127) Koro (127) 10 Koro (127) Theorem msc 05C45 msc 18D20 HamiltonianGraph BondyAndChvatalTheorem