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
• Some sequences associated with combinatorial structures
• Bargaining and network structure: an experiment
• Perfect matchings in hexagonal systems
• Matchings in arbitrary groups.
• Methods of solving some personnel-classification problems
• On a possible extension of Hall's theorem to bipartite hypergraphs
• Three-regular parts of four-regular graphs
• Eine neue Definition der fastperiodischen Funktionen
• The Suslin number of the functor of probability measures
• Chessboard squares
• A theory of nonmonotonic rule systems I
• Characterizing defect \(n\)-extendable bipartite graphs with different connectivities
• Pancyclic PBD block-intersection graphs
• Minimum degree of minimal defect \(n\)-extendable bipartite graphs
• On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs
• Computing large matchings in planar graphs with fixed minimum degree
• The cardinal module and some theorems on families of sets
• The complexity of testing whether a graph is a superconcentrator
• Minor and minimum cycle bases of a 3-connected planar graph
• On completing latin squares
• Embedding an incomplete latin square in a latin square with a prescribed diagonal
• A theorem concerning perfect matchings in hexagonal systems
• Sweet \& sour and other flavours of ccc forcing notions
• A network game with attackers and a defender
• Minimum cycle bases of graphs on surfaces
• Traffic assignment in communication satellites
• On perfect \(k\)-matchings
• Choice functions
• The symbiotic relationship of combinatorics and matrix theory
• On factors with all degrees odd
• Cycle extensions in BIBD block-intersection graphs
• Py-Calabi quasi-morphisms and quasi-states on orientable surfaces of higher genus
• Circuits of each length in tournaments
• Zurückführung des Stundenplanproblems auf ein dreidimensionales Transportproblem
• An implicit data structure for searching a multikey table in logarithmic time
• On the r,s-SAT satisfiability problem and a conjecture of Tovey
• The asymptotic number of (0,1)-matrices with zero permanent
• Constructive proof of deficiency theorem of \((g,f)\)-factor
• Realizations of branched self-coverings of the 2-sphere
• Comments on bases in dependence structures
• Finding total unimodularity in optimization problems solved by linear programs
• Matching subspaces in a field extension.
• Common transversals for partitions of a finite set
• On an application of Hall's representatives theorem to a finite geometry problem
• Systems of representatives

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)