Matchings from a set below to a set above

DOI10.1016/0012-365X(91)90335-YzbMath0761.04003OpenAlexW2090280278MaRDI QIDQ1191919

Jean A. Larson, Paul Erdős

Publication date: 27 September 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90335-y

zbMATH Keywords

bipartite graphpartition relationlarge independent setsdown-up matchingsgraphs on well-ordered sets

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Other combinatorial set theory (03E05)

Cites Work

• A diamond example of an ordinal graph with no infinite paths
• Martin's axiom and ordinal graphs: Large independent sets or infinite paths
• On the strength of König's duality theorem for infinite bipartite graphs
• Necessary and sufficient conditions for transversals of countable set systems
• Injective choice functions for countable families
• Strong transfinite version of König's duality theorem
• A General Criterion for the Existence of Transversals
• Another Criterion for Marriage in Denumerable Societies
• On a Duality Principle in Infinite Bipartite Graphs
• König's Duality Theorem for Infinite Bipartite Graphs
• Injective choice functions
• Unnamed Item
• Unnamed Item

This page was built for publication: Matchings from a set below to a set above