A note on a theorem of Erd˝ os & Gallai
Amitabha Tripathi, Sujith Vijay · 2003
We show that the Erd˝ os–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 6 n 6 p. c 2003 Elsevier Science B.V. All rights reserved. MSC: 05 C07