The Erdِs-Gallai Criterion and Symmetric Functions

Erdِs and Gallai [2] gave a necessary and sufficient condition for an integer sequence to be the degree sequence of a simple graph. We present a proof of this criterion based on the theory of symmetric functions.