Hostname: page-component-78c5997874-g7gxr Total loading time: 0 Render date: 2024-11-04T20:18:20.348Z Has data issue: false hasContentIssue false
  • English
  • Français

Matchings in graphs

Published online by Cambridge University Press:  17 April 2009

P.J. McCarthy
P.J. McCarthy
Affiliation:
Department of Mathematics, University of Kansas, Lawrence, Kansas, USA.
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.

Results of Tutte and of Anderson giving conditions for a simple graph G to have a perfect matching are generalized to give conditions for G to have a matching of defect d. A corollary to one of these results is a theorem of Berge on the size of a maximum matching in G.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 9 , Issue 1 , August 1973 , pp. 141 - 143
Copyright
Copyright © Australian Mathematical Society 1973

References

[1]Anderson, Ian, “Perfect matchings of a graph”, J. Combinatorial Theory Ser. B 10 (1971), 183–186.CrossRefGoogle Scholar
[2]Berge, Claude, “Sur le couplage maximum d'un graphe”, C.R. Acad. Sci. Paris 247 (1958), 258–259.Google Scholar
[3]Berge, Claude, The theory of graphe and its applications (translated by Methuen, Alison Doig, London; John Wiley & Sons, New York, 1962).Google Scholar
[4]Tutte, W.T., “The factorization of linear graphs”, J. London Math. Soc. 22 (1947), 107–111.CrossRefGoogle Scholar