Cited in
(89)- On the equivalence of two conditions for the existence of transversals
- Matchings in infinite graphs
- On k-transversals
- On the number of SDR of a (t,n)-family
- A characterization of transversal topologies
- Hall families and the marriage problem
- On a product dimension of graphs
- Representing matrices
- Matrices of zeros and ones with fixed row and column sum vectors
- Latin cubes of order //omega5
- Note on a theorem of J. Folkman on transversals of infinite families with finitely many infinite members
- Trees with 1-factors and oriented trees
- Infinite matching theory
- A comparison theorem for permanents and a proof of a conjecture on \((t,m)\)-families
- The cardinal module and some theorems on families of sets
- Necessary and sufficient conditions for transversals of countable set systems
- Marriage in denumerable societies
- Independent transversals for countable set systems
- Ergebnisse aus der Transversalentheorie. I, II
- On the number of systems of distinct representatives in an independence structure
- Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n)
- Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function
- Injective choice functions for countable families
- A theorem of the transversal theory for matroids of finite character
- Decomposition of infinite matrices
- Separating marginal utility and probabilistic risk aversion
- A theory of nonmonotonic rule systems I
- Two remarks on the coloring number
- Uniquely total colorable graphs
- Amalgamating infinite Latin squares
- Counting 1-factors in infinite graphs
- On the number of 1-factors of locally finite graphs
- Sufficient regularity conditions for common transversals
- A substitute for Hall's theorem for families with infinite sets
- The homeomorphism group of the first uncountable ordinal
- On the permutative equivalence of squares of unconditional bases
- Uniqueness of unconditional basis of infinite direct sums of quasi-Banach spaces
- Reverse mathematics and marriage problems with unique solutions
- Construction of nonisomorphic reverse Steiner quasigroups
- Combinatorics of reductions between equivalence relations
- Bounds on the rubbling and optimal rubbling numbers of graphs
- Uniform approximations of volume preserving homeomorphisms of \(\mathbb R^n\)
- Applications of Menger's graph theorem
- Submodular functions and independence structures
- Systems of distinct representatives. II
- Identities preserved by the singular direct product. II
- On distinct representatives and mapping theorems
- Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders
- An extension of Hall's theorem for partitioned bipartite graphs
- A problem of Laczkovich: how dense are set systems with no large independent sets?
- Hall's theorem revisited
- Bounds on the rubbling and optimal rubbling numbers of graphs
- Equivalence relations on separated nets arising from linear toral flows
- Decomposition Theory for Lattices Without Chain Conditions
- Matrices of zeros and ones
- A continuous generalization of the transversal property
- Counting common representatives and symmetric chain decompositions
- On the determinant of bipartite graphs
- Clique coverings of graphs V: maximal-clique partitions
- Construction of Steiner Quadruple Systems Having Large Numbers of Nonisomorphic Associated Steiner Triple Systems
- Complementary Trees and Independent Matchings
- Set Theory Generated by Abelian Group Theory
- Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
- A generalization of balanced tableaux and marriage problems with unique solutions
- R. Thompson’s group and the amenability problem
- A proof of a conjecture of Ohba
- Sperner's problem for \(G\)-independent families
- On the strength of marriage theorems and uniformity
- Comments on bases in dependence structures
- A Very General Theorem on Systems of Distinct Representatives
- Common Partial Transversals and Integral Matrices
- On the structure of factorizable graphs
- A Combinatorial Theorem with an Application to Latin Rectangles
- Injective choice functions
- Systems of representatives
- On completing latin squares
- Paradoxical decompositions using Lipschitz functions
- A theory of composition for differential obliviousness
- Approximating latin square extensions
- Generating numbers of rings graded by amenable and supramenable groups
- A conjecture on the number of SDRs of a \((t,n)\)-family
- Fluctuation of firm size in the long-run and bimodal distribution
- List packing number of bounded degree graphs
- Paving matroids: defining equations and associated varieties
- The combinatorics of N. G. de Bruijn
- On the construction of cyclic quasigroups
- On the unimodality of the independent set numbers of a class of matroids
- The complexity of completing partial Latin squares
- Graph factors and factorization: 1985--2003: a survey
This page was built for publication: Distinct representatives of subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5790243)
