Geodesic
Matchings in Countable Graphs
Canadian journal of mathematics, Tome 29 (1977) no. 1, pp. 165-168

Voir la notice de l'article provenant de la source Cambridge University Press

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. 
Steffens, K. Matchings in Countable Graphs. Canadian journal of mathematics, Tome 29 (1977) no. 1, pp. 165-168. doi: 10.4153/CJM-1977-016-8
@article{10_4153_CJM_1977_016_8,
     author = {Steffens, K.},
     title = {Matchings in {Countable} {Graphs}},
     journal = {Canadian journal of mathematics},
     pages = {165--168},
     year = {1977},
     volume = {29},
     number = {1},
     doi = {10.4153/CJM-1977-016-8},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1977-016-8/}
}
TY  - JOUR
AU  - Steffens, K.
TI  - Matchings in Countable Graphs
JO  - Canadian journal of mathematics
PY  - 1977
SP  - 165
EP  - 168
VL  - 29
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1977-016-8/
DO  - 10.4153/CJM-1977-016-8
ID  - 10_4153_CJM_1977_016_8
ER  - 
%0 Journal Article
%A Steffens, K.
%T Matchings in Countable Graphs
%J Canadian journal of mathematics
%D 1977
%P 165-168
%V 29
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1977-016-8/
%R 10.4153/CJM-1977-016-8
%F 10_4153_CJM_1977_016_8

[1] 1. Brualdi, R. A., Matchings in arbitrary graphs, Proc. Camb. Phil. Soc. 69 (1971), 401–407. Google Scholar

[2] 2. Gallai, T., On factorisation of graphs, Acta Math. Acad. Sci. Hungar. 1 (1950), 133–152. Google Scholar

[3] 3. Gallai, T. Neuer Beweis eines Tutte'schen Satzes, Magyar Tud. Akad. Mat. Kutato Int. Kôzl. 8 (1963), 135–139. Google Scholar

[4] 4. Kaluza, Th., Ein Kriterium fiir das Vorhandensein von Faktoren in beliebigen Graphen, Math. Ann. 126 (1953), 464–465 Google Scholar

[5] 5. Lovasz, L., Three short proofs in graph theory, J. Combinatorial Theory (B) 19 (1975), 269- 271 Google Scholar

[6] 6. Podeski, K. P. and Steffens, K., Infective choice functions, J. Combinatorial Theory (B) 21 (1976), 40–46. Google Scholar

[7] 7. Rado, R., Axiomatic treatment of rank in infinite sets, Can. J. Math. 1 (1949), 337–343. Google Scholar

[8] 8. Steffens, K., Ergebnisse aus der Transversalentheorie I, J. Combinatorial Theory (A) 20 (1976), 187–201. Google Scholar

[9] 9. Tutte, W. T., The factorization of linear graphs, J. London Math. Soc. 22 (1947), 107–111. Google Scholar

[10] 10. Tutte, W. T. The factorization of locally finite graphs, Can. J. Math. 2 (1950), 44–49. Google Scholar

Cité par Sources :