A note on a theorem of Erdo's & Gallai

Authors:
Amitabha Tripathi;Sujith Vijay
Affiliations:
Department of Mathematics, Indian Institute of Technology, Hauz Khas, New Delhi 110 016, India;Department of Mathematics, Rutgers University-New Brunswick, Piscataway, NJ
Venue:
Discrete Mathematics
Year:
2003

Citing 0
Cited 5

On the least size of a graph with a given degree set

Discrete Applied Mathematics
Minimum H-decompositions of graphs

Journal of Combinatorial Theory Series B
Note: A simple criterion on degree sequences of graphs

Discrete Applied Mathematics
Note: Constructive extensions of two results on graphic sequences

Discrete Applied Mathematics
Graphic Sequences Have Realizations Containing Bisections of Large Degree

Journal of Graph Theory

Quantified Score

Hi-index	0.05

Visualization

Abstract

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.