A note on a theorem of Erdös & Gallai
We show that the [email protected]?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=