A note on a theorem of Erdős & Gallai

We show that the Erdős–Gallai condition characterizing graphical degree sequences of length p needs to be checked only for as many n as there are distinct terms in the sequence, not all n, 1⩽n⩽p.