Counting 1-factors in infinite graphs

DOI10.1016/0095-8956(90)90072-8zbMath0749.05049OpenAlexW2061293118MaRDI QIDQ1814587

Mao Lin Zheng, Ron Aharoni

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1016/0095-8956(90)90072-8

zbMATH Keywords

1-factors

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Matchings in infinite graphs
• Injective choice functions for countable families
• On the number of 1-factors of locally finite graphs
• On the 1-factors of n-connected graphs
• 1-Faktoren von Graphen. (1-factors of graphs)
• A General Criterion for the Existence of Transversals
• On the 1-factors of a non-separable graph
• On the structure of factorizable graphs
• Distinct representatives of subsets
• On factorisation of graphs

This page was built for publication: Counting 1-factors in infinite graphs