A generalization of Tutte's 1-factor theorem to countable graphs

DOI10.1016/0095-8956(84)90052-2zbMath0552.05044OpenAlexW2064338244MaRDI QIDQ800941

Ron Aharoni

Publication date: 1984

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(84)90052-2

zbMATH Keywords

1-factorperfect matchings

Mathematics Subject Classification ID

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

Related Items (7)

Maximal tight sets and the Edmonds-Gallai decomposition for matchings ⋮ Matchings in infinite graphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Strict matching matroids and matroid algorithms ⋮ The Lovász-Cherkassky theorem in countable graphs ⋮ Infinite matching theory ⋮ LP duality in infinite hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• On an obstruction for perfect matchings
• Matchings in graphs of size \(\aleph_ 1\)
• Injective choice functions for countable families
• A General Criterion for the Existence of Transversals
• Matchings in Countable Graphs
• The Factorization of Linear Graphs
• On factorisation of graphs

This page was built for publication: A generalization of Tutte's 1-factor theorem to countable graphs