Abstract
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.
Publisher
Canadian Mathematical Society
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The computational strength of matchings in countable graphs;Annals of Pure and Applied Logic;2022-08
2. Factors and Factorization;Discrete Mathematics and Its Applications;2013-11-26
3. Graph factors and factorization: 1985–2003: A survey;Discrete Mathematics;2007-04
4. Infinite matching theory;Discrete Mathematics;1991-12
5. f-Optimal factors of infinite graphs;Discrete Mathematics;1991-12