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)

• 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
• Graph with given achromatic number
• Parallel learning of automatic classes of languages
• Short lists with short programs in short time
• Centrality of trees for capacitated \(k\)-center
• A combinatorial problem involving graphs and matrices
• Three-dimensional orthogonal graph drawing algorithms
• On a generalization of the Ryser-Brualdi-Stein conjecture
• Finding a complete matching with the maximum product on weighted bipartite graphs
• Experiments in rectangular areas: design and randomization
• Adjusting prices in the multiple-partners assignment game
• Stable sets in two subclasses of banner-free graphs
• Graph factors
• Topological cliques of random graphs
• Exact and approximate algorithms for movement problems on (special classes of) graphs
• The cycle structure for directed graphs on surfaces
• A Combinatorial Theorem with an Application to Latin Rectangles
• On the Kräuter-Seifter theorem on permanent divisibility
• The strong chromatic index of a cubic graph is at most 10
• Estimation and Marginalization Using the Kikuchi Approximation Methods
• List strong edge-colorings of sparse graphs
• Towards a reverse Newman's theorem in interactive information complexity
• Horofunctions on graphs of linear growth
• Submodular functions and independence structures
• Strategic network formation through peering and service agreements
• Full spark frames
• The time dependent traveling salesman problem: polyhedra and algorithm
• Decomposition of balanced matrices
• An upper bound for the chromatic number of line graphs
• Matroids on partially ordered sets
• Matching preclusion for cube-connected cycles
• Corrádi and Hajnal's theorem for sparse random graphs
• Dimer models and Calabi-Yau algebras
• An arithmetic characterization of the rational homotopy groups of certain spaces
• Some results on generalized Latin squares
• Multipartite graph-sparse graph Ramsey numbers
• Applications of Menger's graph theorem
• The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach
• Anti-Ramsey problems for \(t\) edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees
• Proof pearl: the marriage theorem
• Regularity and Positional Games
• Perfect matchings in balanced hypergraphs
• Cliques in the union of graphs
• The poset on connected graphs is Sperner
• School choice: Nash implementation of stable matchings through rank-priority mechanisms
• Systems of distant representatives
• Ramsey Numbers for the Pair Sparse Graph-Path or Cycle
• On chromatic‐choosable graphs
• 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

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)