On a Duality Principle in Infinite Bipartite Graphs

DOI10.1112/JLMS/S2-28.3.385zbMATH Open0505.05048OpenAlexW2010707166MaRDI QIDQ4740596FDOQ4740596

Ron Aharoni

Publication date: 1983

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s2-28.3.385

zbMATH Keywords

matchingedge coverKoenig's duality theorem

Mathematics Subject Classification ID

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

Cited In (4)

• On the strength of König's duality theorem for infinite bipartite graphs
• Menger's theorem for graphs containing no infinite paths
• Matchings from a set below to a set above
• The Lovász-Cherkassky theorem in countable graphs

This page was built for publication: On a Duality Principle in Infinite Bipartite Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4740596)