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
(22)- Menger's theorem in \(\Pi^1_1 \mathrm {-CA}_0\)
- Über Translationen und den Satz von Menger in unendlichen Graphen
- Menger's theorem for infinite graphs
- On the strength of König's duality theorem for infinite bipartite graphs
- Hall families and the marriage problem
- Counting 1-factors in infinite graphs
- Ergebnisse aus der Transversalentheorie. I, II
- Infinite matching theory
- Marriage in denumerable societies
- Fractional matchings and covers in infinite hypergraphs
- Tight infinite matrices
- A derived isometry theorem for sheaves
- Matchings from a set below to a set above
- The Lovász-Cherkassky theorem in infinite graphs
- Graph factors and factorization: 1985--2003: a survey
- A generalization of Tutte's 1-factor theorem to countable graphs
- LP duality in infinite hypergraphs
- Set systems with finite chromatic number
- On the equivalence of two conditions for the existence of transversals
- Independent transversals for countable set systems
- On the strength of König's duality theorem for countable bipartite graphs
- On k-transversals
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)
