On Representatives of Subsets
From MaRDI portal
Publication:4760022
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
Cited In (only showing first 100 items - show all)
- The semigroup of Hall relations
- A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks
- Pancyclic BIBD block-intersection graphs
- Covering digraphs by paths
- Three‐regular subgraphs of four‐regular graphs
- Edge-chromatic numbers of Mycielski graphs
- Integer and fractional security in graphs
- Kidney exchange: an egalitarian mechanism
- Exploring the complexity boundary between coloring and list-coloring
- Conditional matching preclusion sets
- The Erdős-Ko-Rado properties of set systems defined by double partitions
- Title not available (Why is that?)
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique
- The morphology of partially ordered sets
- Pairwise kidney exchange
- Primitive permutation groups and their section-regular partitions.
- A perspective on certain polynomial-time solvable classes of satisfiability
- On the balanced decomposition number
- On factorisation of graphs
- An algorithm for identifying fair and optimal allocations
- On bounded block decomposition problems for under-specified systems of equations
- On mod \((2p+1)\)-orientations of graphs
- Linear pencils of tropical plane curves
- Score vectors of tournaments
- \(k\)-restricted edge-connectivity in triangle-free graphs
- Indivisible plexes in Latin squares
- Short containers in Cayley graphs
- Injective choice functions for countable families
- Eigenvalues and perfect matchings
- Integer partitions and the Sperner property
- Avoiding partial Latin squares and intricacy
- Tight bounds on maximal and maximum matchings
- An extension of Hall's theorem for partitioned bipartite graphs
- Traceability in graphs with forbidden triples of subgraphs
- Rado's theorem for polymatroids
- An analytic approach to stability
- The intersection of a matroid and a simplicial complex
- On the number of vertices belonging to all maximum stable sets of a graph
- Structures and lower bounds for binary covering arrays
- Non-manipulable assignment of individuals to positions revisited
- Cell decompositions of \(C\)-minimal structures
- \((F, I)\)-security in graphs
- The English auction with differentiated commodities
- Disconnected 2-factors in planar cubic bridgeless graphs
- Uniformly Exhaustive Submeasures and Nearly Additive Set Functions
- Independent systems of representatives in weighted graphs
- Perfect matchings after vertex deletions
- A Hall-type theorem for triplet set systems based on medians in trees
- Balanced matrices
- Star decomposition of graphs
- Dividing a cake fairly
- The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable
- Near-automorphisms of Latin squares
- Asymptotic multipartite version of the Alon-Yuster theorem
- From Hall's matching theorem to optimal routing on hypercubes
- Hall's theorem and extending partial Latinized rectangles
- On packing arborescences in temporal networks
- Triangle-free partial graphs and edge covering theorems
- Inapproximability and approximability of maximal tree routing and coloring
- Perfect matchings of a graph
- Matrices of zeros and ones
- Ordinal efficiency and dominated sets of assignments.
- Extending Hall's theorem into list colorings: a partial history
- Orientations of graphs with prescribed weighted out-degrees
- 2-distance paired-dominating number of graphs
- Sets in excess demand in simple ascending auctions with unit-demand bidders
- On bounding the difference of the maximum degree and the clique number
- Strong chromatic index of subcubic planar multigraphs
- Chorded cycles
- Characterizations of transversal matroids and their presentations
- Graph factors and factorization: 1985--2003: a survey
- Families of pairs of graphs with a large number of common cards
- Entropic uncertainty relations and the stabilizer formalism
- Upper bounds on the paired-domination number
- Imbedding posets in the integers
- Clique-perfectness of complements of line graphs
- Characterization of the Walrasian equilibria of the assignment model
- The binding number of a graph and its Anderson number
- Shifting: one-inclusion mistake bounds and sample compression
- Fully packed loops in a triangle: matchings, paths and puzzles
- On a conjecture of Füredi.
- 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
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)
