Introduction
The Erdős–Gallai theorem gives a necessary and sufficient condition for a sequence of non-negative integers to be the degree sequence of a simple graph.
In other words, it tells us whether a given sequence can appear as the list of vertex degrees in some graph without loops or multiple edges.
Theorem Statement
Let