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