\begin{definition}[Definition:Ore Graph]
Let $G = \struct {V, E}$ be an undirected simple graph.
Then $G$ is an '''Ore graph''' {{iff}}:
:the sum of the degrees of every pair of non-adjacent vertices is greater than or equal to the order of $G$.
That is, {{iff}}:
:$\forall u, v \in V: \set {u, v} \notin E \implies \map {\deg_G} u + \map {\deg_G} v \ge \card V$
\end{definition}