Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-15T23:08:17.063Z Has data issue: false hasContentIssue false

Matchings in Countable Graphs

Published online by Cambridge University Press:  20 November 2018

K. Steffens*
Affiliation:
Technische Universität Hannover, Hannover, West Germany
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.

Tutte [9] has given necessary and sufficient conditions for a finite graph to have a perfect matching. Different proofs are given by Brualdi [1] and Gallai [2; 3]. The shortest proof of Tutte's theorem is due to Lovasz [5]. In another paper [10] Tutte extended his conditions for a perfect matching to locally finite graphs. In [4] Kaluza gave a condition on arbitrary graphs which is entirely different from Tutte's.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1977