On the number of 1-factors of locally finite graphs

DOI10.1016/0095-8956(83)90005-9zbMath0512.05049OpenAlexW2170290182MaRDI QIDQ1839264

François Bry

Publication date: 1983

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://epub.ub.uni-muenchen.de/8435/1/Bry_Fran_ois_8435.pdf

zbMATH Keywords

1-factorperfect matchinglocally finite infinite graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Related Items

Counting 1-factors in infinite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The Edmonds-Gallai decomposition for matchings in locally finite graphs
• Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
• On the 1-factors of n-connected graphs
• 1-Faktoren von Graphen. (1-factors of graphs)
• Über die Anzahl der 1-Faktoren in 2-fach zusammenhängenden Graphen
• Paths, Trees, and Flowers
• On the 1-factors of a non-separable graph
• On the structure of factorizable graphs
• Distinct representatives of subsets
• The Factorization of Locally Finite Graphs