On Representatives of Subsets

DOI10.1112/JLMS/S1-10.37.26zbMATH Open0010.34503OpenAlexW2063292248WikidataQ56144536 ScholiaQ56144536MaRDI QIDQ4760022FDOQ4760022

Authors: Philip Hall 

Publication date: 1935

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s1-10.37.26

zbMATH Keywords

set theory, real functions

Cited In (only showing first 100 items - show all)

• DIAGRAMS WITH SELECTION AND METHOD FOR CONSTRUCTING BOUNDEDLY GENERATED AND BOUNDEDLY SIMPLE GROUPS
• Geometry and the simplex: results, questions and ideas
• Construction and optimality of nearly linear trend-free designs
• The 1-width of (0,1)-matrices having constant row sum 3
• Hall number for list colorings of graphs: Extremal results
• Constructions of doubly resolvable Steiner quadruple systems
• Small embeddings of partial Steiner triple systems
• The Hall number, the Hall index, and the total Hall number of a graph
• Partial matroid representations
• Transversal theory and the study of abstract independence
• Hall's criterion as a 'self-refining' result
• The rank formula of Nash-Williams as a source of covering and packing theorems
• A packet filter placement problem with application to defense against spoofed denial of service attacks
• Short cycle structures for graphs on surfaces and an open problem of Mohar and Thomassen
• Saturating stable matchings
• Incidence properties of cosets in loops.
• A continuous generalization of the transversal property
• Some E-optimal row-column designs having unequally replicated treatments
• Fixed-point-free embeddings of digraphs with small size
• Walrasian's characterization and a universal ascending auction
• Infinite matching theory
• Partnership formation and binomial semivalues
• Combinatorial formulae for multiple set-valued labellings
• Balanced coloring of bipartite graphs
• Some Monotonicity Properties of Partial Orders
• Symmetry and impartial lotteries
• Independence in 5-uniform hypergraphs
• Robust multivalued solutions for assignment problems: A note
• List multicoloring problems involving the \(k\)-fold Hall numbers
• Partitioned transversals
• Lineare Programme und allgemeine Vertretersysteme
• Efficient simulation of circuits by EREW PRAMs
• Existence of perfect matchings in a plane bipartite graph
• Neighborhood conditions and edge-disjoint perfect matchings
• Uniform probability
• An extremal problem on v-partite graphs
• Systems of distinct representatives. II
• On a generalized matching problem arising in estimating the eigenvalue variation of two matrices
• An interpolation theorem for partitions which are complete with respect to hereditary properties
• Alliances, partnerships and the Banzhaf semivalue
• The 'marriage game': An assignment problem with indivisibilities
• Variations on instant insanity
• An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves
• Separators and structure prediction in sparse orthogonal factorization
• On the completion of latin rectangles to symmetric latin squares
• Deadlock-freedom in resource contentions
• Set systems with finite chromatic number
• Upper bound for linear arboricity
• On the equivalence of two conditions for the existence of transversals
• Short cycle structure of graphs on surfaces. I: The uniqueness theorems
• Subgraphs intersecting any Hamiltonian cycle
• Model robust optimal designs for comparing test treatments with a control
• Matchings in infinite graphs
• On k-transversals
• Two classes of \(q\)-ary codes based on group divisible association schemes
• Reverse mathematics and marriage problems with unique solutions
• The women of Cairo: equilibria in large anonymous games
• Identifying restrictions of linear equations with applications to simultaneous equations and cointegration
• Properties of vertex cover obstructions
• New integer linear programming approaches for course timetabling
• A lower bound on the independence number of a graph in terms of degrees and local clique sizes
• Rank of adjacency matrices of directed (strongly) regular graphs
• The dimension of random ordered sets
• Finding all maximally-matchable edges in a bipartite graph
• Regular Hypertournaments and Arc-Pancyclicity
• A monotone Sinai theorem
• Crown reductions for the minimum weighted vertex cover problem
• Discrete Gabor frames in \(\ell^2(\mathbb Z^d)\)
• A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem
• Selected topics on assignment problems
• Kapranov rank vs. tropical rank
• A simplified NP-complete satisfiability problem
• The complexity of completing partial Latin squares
• An efficient bounds consistency algorithm for the global cardinality constraint
• Ohba's conjecture for graphs with independence number five
• Cross-intersecting families and primitivity of symmetric systems
• Equivalent subsets of a colored set
• On a \(k\)-tree containing specified leaves in a graph
• Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
• Representation of systems of measurable sets
• Matching preclusion for vertex-transitive networks
• Total edge irregularity strength of complete graphs and complete bipartite graphs
• Menger's theorem for infinite graphs
• Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
• A matroid on hypergraphs, with applications in scene analysis and geometry
• On spanning trees with restricted degrees
• Sufficient conditions for 2-rainbow connected graphs
• Graphs without minor complete subgraphs
• Zero-sum flows in regular graphs
• On finding augmenting graphs
• Bargaining in a network of buyers and sellers.
• Kernelization -- preprocessing with a guarantee
• On n-extendable graphs
• A structure theorem for maximum internal matchings in graphs
• Dulmage-Mendelsohn canonical decomposition as a generic pruning technique
• The existence of Howell designs of even side
• Matching theory -- a sampler: From Dénes König to the present
• Generating cycle spaces for graphs on surfaces with small genera
• Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules
• Linear CNF formulas and satisfiability

This page was built for publication: On Representatives of Subsets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4760022)