Hostname: page-component-8448b6f56d-c4f8m Total loading time: 0 Render date: 2024-04-17T19:52:58.783Z Has data issue: false hasContentIssue false
  • English
  • Français

A simple proof of the Erdos-Gallai theorem on graph sequences

Published online by Cambridge University Press:  17 April 2009

S.A. Choudum
S.A. Choudum
Affiliation:
School of Mathematical Sciences, Madurai Kamaraj University, Madurai – 625 021, India.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A central theorem in the theory of graphic sequences is due to P. Erdos and T. Gallai. Here, we give a simple proof of this theorem by induction on the sum of the sequence.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 33 , Issue 1 , February 1986 , pp. 67 - 70
Copyright
Copyright © Australian Mathematical Society 1986

References

[1]Berge, C., Graphs and Hypergraphs, (North Holland Pub. co., Amsterdam, 1973).Google Scholar
[2]Erdos, P. and Gallai, T., “Graphs with given degrees of vertices”, Mat. Lapok, 11 (1960), 264–274.Google Scholar
[3]Harary, F., Graph Theory, (Addison wesley, Reading, 1969).Google Scholar