Injective choice functions for countable families
From MaRDI portal
Cites work
- Distinct representatives of subsets
- Exchange systems, matchings, and transversals
- Injective choice functions
- Necessary and sufficient conditions for transversals of countable set systems
- Note on the Transfinite Case of Hall's Theorem on Representatives
- On Representatives of Subsets
- Some notes on Feinberg's k-independence problem
- Strong transfinite version of König's duality theorem
- Transversals of infinite families
- Transversals of infinite families with finitely many infinite members
Cited in
(24)- Menger's theorem for infinite graphs
- On the equivalence of two conditions for the existence of transversals
- On k-transversals
- Fractional matchings and covers in infinite hypergraphs
- Hall families and the marriage problem
- 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
- Counting 1-factors in infinite graphs
- A derived isometry theorem for sheaves
- Menger's theorem in \(\Pi^1_1 \mathrm {-CA}_0\)
- Über Translationen und den Satz von Menger in unendlichen Graphen
- On the strength of König's duality theorem for countable bipartite graphs
- Tight infinite matrices
- The Lovász-Cherkassky theorem in infinite graphs
- Zorn's lemma, reverse mathematics, and applications in combinatorics
- Halin's infinite ray theorems: complexity and reverse mathematics
- A generalization of Tutte's 1-factor theorem to countable graphs
- LP duality in infinite hypergraphs
- Set systems with finite chromatic number
- Graph factors and factorization: 1985--2003: a survey
This page was built for publication: Injective choice functions for countable families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1237732)
