Injective choice functions for countable families
From MaRDI portal
Publication:1237732
DOI10.1016/0095-8956(76)90025-3zbMath0357.04017OpenAlexW1985708759MaRDI QIDQ1237732
Karsten Steffens, Klaus-Peter Podewski
Publication date: 1976
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(76)90025-3
Related Items (20)
On k-transversals ⋮ On the strength of König's duality theorem for countable bipartite graphs ⋮ Fractional matchings and covers in infinite hypergraphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Hall families and the marriage problem ⋮ Menger's theorem in \(\Pi^1_1 \mathrm {-CA}_0\) ⋮ Infinite matching theory ⋮ Matchings from a set below to a set above ⋮ On the strength of König's duality theorem for infinite bipartite graphs ⋮ Marriage in denumerable societies ⋮ Independent transversals for countable set systems ⋮ Ergebnisse aus der Transversalentheorie. I, II ⋮ Über Translationen und den Satz von Menger in unendlichen Graphen ⋮ Menger's theorem for infinite graphs ⋮ Counting 1-factors in infinite graphs ⋮ A derived isometry theorem for sheaves ⋮ On the equivalence of two conditions for the existence of transversals ⋮ A generalization of Tutte's 1-factor theorem to countable graphs ⋮ LP duality in infinite hypergraphs ⋮ Set systems with finite chromatic number
Cites Work
- Some notes on Feinberg's k-independence problem
- Necessary and sufficient conditions for transversals of countable set systems
- Strong transfinite version of König's duality theorem
- Transversals of infinite families
- On Representatives of Subsets
- Note on the Transfinite Case of Hall's Theorem on Representatives
- Exchange systems, matchings, and transversals
- Transversals of infinite families with finitely many infinite members
- Distinct representatives of subsets
- Injective choice functions
This page was built for publication: Injective choice functions for countable families
