Matchings from a set below to a set above
From MaRDI portal
Publication:1191919
DOI10.1016/0012-365X(91)90335-YzbMath0761.04003MaRDI QIDQ1191919
Publication date: 27 September 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
bipartite graph; partition relation; large independent sets; down-up matchings; graphs on well-ordered sets
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
03E05: Other combinatorial set theory
Cites Work
- Unnamed Item
- Unnamed Item
- 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