Matchings in infinite graphs

DOI10.1016/0095-8956(88)90098-6zbMath0642.05048OpenAlexW2083392470MaRDI QIDQ1101134

Ron Aharoni

Publication date: 1988

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(88)90098-6

zbMATH Keywords

perfect matchinginfinite graphs

Mathematics Subject Classification ID

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

Related Items

Graph factors and factorization: 1985--2003: a survey ⋮ The computational strength of matchings in countable graphs ⋮ The Lovász-Cherkassky theorem in countable graphs ⋮ Infinite matching theory ⋮ Menger's theorem for infinite graphs ⋮ Counting 1-factors in infinite graphs ⋮ Matchings in graphs of size \(\aleph_ 1\) ⋮ LP duality in infinite hypergraphs

Cites Work

• On an obstruction for perfect matchings
• A generalization of Tutte's 1-factor theorem to countable graphs
• Matchings in graphs of size \(\aleph_ 1\)
• A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
• A General Criterion for the Existence of Transversals
• Matchings in Countable Graphs
• König's Duality Theorem for Infinite Bipartite Graphs
• On Representatives of Subsets
• The Factorization of Linear Graphs
• Distinct representatives of subsets
• The Factors of Graphs
• Unnamed Item