On Representatives of Subsets
From MaRDI portal
Publication:4760022
DOI10.1112/jlms/s1-10.37.26zbMath0010.34503OpenAlexW2063292248WikidataQ56144536 ScholiaQ56144536MaRDI QIDQ4760022
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
Related Items
Comments on bases in dependence structures, On odd circuits in chromatic graphs, Remark on a criterion for common transversals, Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints, Three‐regular subgraphs of four‐regular graphs, On the completion of latin rectangles to symmetric latin squares, Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs, Zurückführung des Stundenplanproblems auf ein dreidimensionales Transportproblem, Graph and hypergraph colouring via nibble methods: a survey, List strong edge-colorings of sparse graphs, The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree, On the Hadamard-Fischer inequality, the inclusion-exclusion formula, and bipartite graphs, A quest for a fair schedule: the international Young Physicists' Tournament, Equitable scheduling on a single machine, Choice functions, The tight bound for the strong chromatic indices of claw-free subcubic graphs, Graphs with each edge in at most one maximum matching, A Very General Theorem on Systems of Distinct Representatives, Solution to a problem of Katona on counting cliques of weighted graphs, Hall's theorem for enumerable families of finite sets, Efficiently recognizing graphs with equal independence and annihilation numbers, Domination mappings into the Hamming ball: existence, constructions, and algorithms, Revisiting semistrong edge‐coloring of graphs, Unnamed Item, Sparse Hypergraphs with Applications to Coding Theory, Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems, Common Partial Transversals and Integral Matrices, Hyperfinite transversal theory. II, Estimation and Marginalization Using the Kikuchi Approximation Methods, Exploring the complexity boundary between coloring and list-coloring, Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts, Diverse Pairs of Matchings, A New Description of Transversal Matroids Through Rough Set Approach, Computing double cosets in soluble groups, Perfect matchings in hexagonal systems, On the separation power and the completion of partial latin squares, On the separation power and the completion of partial latin squares, Persistency in combinatorial optimization problems on matroids, Injective choice functions, The binding number of a graph and its Anderson number, Unnamed Item, DIAGRAMS WITH SELECTION AND METHOD FOR CONSTRUCTING BOUNDEDLY GENERATED AND BOUNDEDLY SIMPLE GROUPS, On completing latin squares, Combinatorial problems related to origin-destination matrices., Ranks and determinants of the sum of matrices from unitary orbits, Exact algorithms for weighted and unweighted Borda manipulation problems, Completing partial Latin squares with blocks of non-empty cells, On 1-factorizations of bipartite Kneser graphs, Representations of finite sets and correspondences, Kapranov rank vs. tropical rank, Systems of representatives, Clique-perfectness of complements of line graphs, On factorisation of graphs, A Nonasymptotic Approach to Analyzing Kidney Exchange Graphs, Unnamed Item, Characterizations of transversal matroids and their presentations, Unbiased Version of Hall’s Marriage Theorem in Matrix Form, Planar 3-SAT with a clause/variable cycle, Star decomposition of graphs, A Combinatorial Theorem with an Application to Latin Rectangles, Partitioned transversals, Characterizations of transversal matroids and their presentations, Multipartite graph-sparse graph Ramsey numbers, Subgraphs intersecting any Hamiltonian cycle, Compatible systems of representatives, Goodness of trees for generalized books, Maximum of k-th maximal spanning trees of a weighted graph, Model robust optimal designs for comparing test treatments with a control, Matchings in infinite graphs, On a theorem of J. Ossowski, On k-transversals, A matroid on hypergraphs, with applications in scene analysis and geometry, On an application of Hall's representatives theorem to a finite geometry problem, Extremal theory and bipartite graph-tree Ramsey numbers, On the number of SDR of a (t,n)-family, The two ear theorem on matching-covered graphs, Hall-conditions and the three-family problem, Systems of distinct representatives for k families of sets, Completing partial latin squares, Hall families and the marriage problem, Ensembles d'articulation d'un graphe \(\gamma\)-critique, On n-extendable graphs, Subgraphs and their degree sequences of a digraph, Dividing a cake fairly, The complexity of testing whether a graph is a superconcentrator, On two-factors of bipartite regular graphs, Graph factors, A combinatorial problem involving graphs and matrices, Triangle-free partial graphs and edge covering theorems, Neighborhood conditions and edge-disjoint perfect matchings, Matchings and cycle covers in random digraphs, The symbiotic relationship of combinatorics and matrix theory, A structure theorem for maximum internal matchings in graphs, An implicit data structure for searching a multikey table in logarithmic time, Infinite matching theory, A comparison theorem for permanents and a proof of a conjecture on \((t,m)\)-families, The notion and basic properties of \(M\)-transversals, The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable, Matching theory -- a sampler: From Dénes König to the present, The strong chromatic index of a cubic graph is at most 10, On existence of sets of distinct representatives for families of subsets of a multiset, The asymptotic number of (0,1)-matrices with zero permanent, The semigroup of Hall relations, The morphology of partially ordered sets, The cardinal module and some theorems on families of sets, Truncations of principal geometries, Necessary and sufficient conditions for transversals of countable set systems, Marriage in denumerable societies, A number-theoretic function related to Latin squares, Mutually disjoint families of 0-1 sequences, Independent transversals for countable set systems, Ergebnisse aus der Transversalentheorie. I, II, Score vectors of tournaments, Common transversals, On the number of systems of distinct representatives in an independence structure, Embedding incomplete double diagonal latin squares, Graph with given achromatic number, Identification of simultaneous equation models with measurement error, Local matching in the function space of a partial order, Common transversals in partitioning families, Injective choice functions for countable families, Decomposition of nonnegative integral matrices, Transversal theory and rank functions, Modifications of object sizes and box capacities to achieve a simultaneous fitting, A theorem of the transversal theory for matroids of finite character, Covering digraphs by paths, An arithmetic characterization of the rational homotopy groups of certain spaces, Maximum antichains in the partition lattice, Conditional matching preclusion sets, Indivisible plexes in Latin squares, Distinct representatives, varieties and rational homotopy, Partnership formation and binomial semivalues, Optimal block designs for comparing test treatments with a control when \(k>v\), Tight bounds for minimax grid matching with applications to the average case analysis of algorithms, Decomposition of infinite matrices, Menger's theorem for infinite graphs, On the n-cutset property, Matroids on partially ordered sets, Primitive permutation groups and their section-regular partitions., Short containers in Cayley graphs, Linear CNF formulas and satisfiability, Number of mutual connections in neighborhoods and its application to self-diagnosable systems, Minor and minimum cycle bases of a 3-connected planar graph, Complexities of some interesting problems on spanning trees, The Hall number, the Hall index, and the total Hall number of a graph, On list critical graphs, The Erdős-Ko-Rado properties of set systems defined by double partitions, Minimum degree of minimal defect \(n\)-extendable bipartite graphs, Embeddings of \(P_{3}\)-designs into bowtie and almost bowtie systems, The Suslin number of the functor of probability measures, Two classes of \(q\)-ary codes based on group divisible association schemes, Some Ore-type conditions for the existence of connected \([2,k\)-factors in graphs], The strong Hall property and symmetric chain orders, On a generalized matching problem arising in estimating the eigenvalue variation of two matrices, On the equivalence of two conditions for the existence of transversals, Conditions for the existence of a system of different set representatives, Detection of structural inconsistency in systems of equations with degrees of freedom and its applications, On factors with all degrees odd, On graphs \(G\) for which all large trees are \(G\)-good, Cell decompositions of \(C\)-minimal structures, Combinatorial formulae for multiple set-valued labellings, Some sequences associated with combinatorial structures, A monotone Sinai theorem, Constructions of doubly resolvable Steiner quadruple systems, Matching preclusion for vertex-transitive networks, On spanning trees with restricted degrees, A lower bound on the independence number of a graph in terms of degrees and local clique sizes, Sufficient conditions for 2-rainbow connected graphs, Characterization of the Walrasian equilibria of the assignment model, A Hall-type theorem for triplet set systems based on medians in trees, A packet filter placement problem with application to defense against spoofed denial of service attacks, Parallel learning of automatic classes of languages, Short cycle structures for graphs on surfaces and an open problem of Mohar and Thomassen, On a \(k\)-tree containing specified leaves in a graph, Towards a reverse Newman's theorem in interactive information complexity, Horofunctions on graphs of linear growth, Graph factors and factorization: 1985--2003: a survey, Traffic assignment in communication satellites, The existence of Howell designs of even side, New exact values of the maximum size of graphs free of topological complete subgraphs, Topological cliques of random graphs, Graphs without minor complete subgraphs, Fixed-point-free embeddings of digraphs with small size, Zero-sum flows in regular graphs, Characterizing defect \(n\)-extendable bipartite graphs with different connectivities, Py-Calabi quasi-morphisms and quasi-states on orientable surfaces of higher genus, Realizations of branched self-coverings of the 2-sphere, Cross-intersecting families and primitivity of symmetric systems, Symmetry and impartial lotteries, Edge-chromatic numbers of Mycielski graphs, Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique, Centrality of trees for capacitated \(k\)-center, Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication, A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks, On the balanced decomposition number, Independence in 5-uniform hypergraphs, On bounded block decomposition problems for under-specified systems of equations, Finding all maximally-matchable edges in a bipartite graph, Finding total unimodularity in optimization problems solved by linear programs, Matching subspaces in a field extension., \(k\)-restricted edge-connectivity in triangle-free graphs, Efficient simulation of circuits by EREW PRAMs, Integer and fractional security in graphs, A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem, Structures and lower bounds for binary covering arrays, Linear pencils of tropical plane curves, Some E-optimal row-column designs having unequally replicated treatments, Uniform probability, Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules, Extending Hall's theorem into list colorings: a partial history, Alliances, partnerships and the Banzhaf semivalue, Sampling complete designs, A network game with attackers and a defender, Hall's theorem and extending partial Latinized rectangles, Fully packed loops in a triangle: matchings, paths and puzzles, On packing arborescences in temporal networks, Experiments in rectangular areas: design and randomization, Dulmage-Mendelsohn canonical decomposition as a generic pruning technique, Tropical determinant of integer doubly-stochastic matrices, Orientations of graphs with prescribed weighted out-degrees, 2-distance paired-dominating number of graphs, Equivalent subsets of a colored set, On bounding the difference of the maximum degree and the clique number, Strong chromatic index of subcubic planar multigraphs, Chorded cycles, Bond graphs. II: Causality and singularity, Short cycle structure of graphs on surfaces. I: The uniqueness theorems, On finding augmenting graphs, Submodular functions in graph theory, Interval incidence coloring of subcubic graphs, Total edge irregularity strength of complete graphs and complete bipartite graphs, Hall number for list colorings of graphs: Extremal results, Adjusting prices in the multiple-partners assignment game, Kidney exchange: an egalitarian mechanism, Ohba's conjecture for graphs with independence number five, Selected topics on assignment problems, Computing large matchings in planar graphs with fixed minimum degree, On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs, An analytic approach to stability, An algorithmic study of switch graphs, Strategic network formation through peering and service agreements, Constructive proof of deficiency theorem of \((g,f)\)-factor, Upper bounds on the paired-domination number, On mod \((2p+1)\)-orientations of graphs, Non-manipulable assignment of individuals to positions revisited, \((F, I)\)-security in graphs, Circuits of each length in tournaments, On a possible extension of Hall's theorem to bipartite hypergraphs, Common transversals for partitions of a finite set, Three-regular parts of four-regular graphs, Imbedding posets in the integers, Lineare Programme und allgemeine Vertretersysteme, An extremal problem on v-partite graphs, A simplified NP-complete satisfiability problem, The 'marriage game': An assignment problem with indivisibilities, The complexity of completing partial Latin squares, Embedding an incomplete latin square in a latin square with a prescribed diagonal, Deadlock-freedom in resource contentions, Set systems with finite chromatic number, Upper bound for linear arboricity, Pairwise kidney exchange, An efficient bounds consistency algorithm for the global cardinality constraint, A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs, On a conjecture of Karasev, Pancyclic BIBD block-intersection graphs, Tight bounds on maximal and maximum matchings, Finding a complete matching with the maximum product on weighted bipartite graphs, Sweet \& sour and other flavours of ccc forcing notions, Generating cycle spaces for graphs on surfaces with small genera, Integer partitions and the Sperner property, Addressing time-scale differences among decision-makers through model abstractions, The feasible matching problem, Some results on characterizing the edges of connected graphs with a given domination number, Chessboard squares, Identifying restrictions of linear equations with applications to simultaneous equations and cointegration, A theory of nonmonotonic rule systems I, Minimean optimal key arrangements in hash tables, ReGale: some memorable results, Separators and structure prediction in sparse orthogonal factorization, Two remarks on the coloring number, Construction and optimality of nearly linear trend-free designs, The poset on connected graphs is Sperner, On the asymptotic behavior of the independence number of a random \((n,n)\)-tree, On finite matroids with one more hyperplane than points, On the Kräuter-Seifter theorem on permanent divisibility, Cycles through all finite vertex sets in infinite graphs, Some results on generalized Latin squares, Graph matching problems and the NP-hardness of sortedness constraints, Coronoid systems with perfect matchings, Avoiding partial Latin squares and intricacy, Asymptotic multipartite version of the Alon-Yuster theorem, Note on incidence chromatic number of subquartic graphs, The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach, Tripartite-to-bipartite entanglement transformation by stochastic local operations and classical communication and the structure of matrix spaces, The strong chromatic index of graphs with edge weight eight, Extension of partial diagonals of matrices. II, An algorithm for identifying fair and optimal allocations, Full spark frames, Cube term blockers without finiteness, On finite exchangeability and conditional independence, Grimm's conjecture and smooth numbers, The time dependent traveling salesman problem: polyhedra and algorithm, Ordinal efficiency and dominated sets of assignments., Balanced matrices, A refinement of the function \(g(x)\) on Grimm's conjecture, Stable sets in two subclasses of banner-free graphs, Graphs vertex-partitionable into strong cliques, On perfect \(k\)-matchings, Bargaining in a network of buyers and sellers., Sets in excess demand in simple ascending auctions with unit-demand bidders, Properties of vertex cover obstructions, Bargaining and network structure: an experiment, Independent systems of representatives in weighted graphs, A 3/2-approximation algorithm for the graph balancing problem with two weights, Short lists with short programs in short time, Integer programming models for mid-term production planning for high-tech low-volume supply chains, Geometry and the simplex: results, questions and ideas, On 2-factor Hamiltonian regular bipartite graphs, The cycle structure for directed graphs on surfaces, Reverse mathematics and marriage problems with unique solutions, Minimum fill-in of sparse graphs: kernelization and approximation, Systems of distant representatives, Finite structure for Friedman ideals of finite trees, Nested chain partitions of LYM posets, Eigenvalues and perfect matchings, A factorization theorem for a certain class of graphs, Walrasian's characterization and a universal ascending auction, Partial matroid representations, Space proof complexity for random 3-CNFs, Constrainedly fair job assignments under minimum wages, Zero forcing versus domination in cubic graphs, Some remarks on nestings in the normalized matching posets of rank 3, Equitable total coloring of corona of cubic graphs, A marriage theorem with Lebesgue measure, The discrete separation theorem and price adjustment directions in markets with heterogeneous commodities, School choice: Nash implementation of stable matchings through rank-priority mechanisms, Saturating stable matchings, Direction trees, On the r,s-SAT satisfiability problem and a conjecture of Tovey, A theorem concerning perfect matchings in hexagonal systems, From Hall's matching theorem to optimal routing on hypercubes, Decomposition of balanced matrices, Three-dimensional orthogonal graph drawing algorithms, The English auction with differentiated commodities, Traceability in graphs with forbidden triples of subgraphs, Sufficient regularity conditions for common transversals, The 1-width of (0,1)-matrices having constant row sum 3, A substitute for Hall's theorem for families with infinite sets, On the number of vertices belonging to all maximum stable sets of a graph, Disconnected 2-factors in planar cubic bridgeless graphs, Remarks on proper conflict-free colorings of graphs, Linear measurement models -- axiomatizations and axiomatizability, No easy puzzles: hardness results for jigsaw puzzles, Tropical determinant on transportation polytopes, Systems of distant representatives in Euclidean space, A perspective on certain polynomial-time solvable classes of satisfiability, Cliques in the union of graphs, On a conjecture of Füredi., Combinatorics of reductions between equivalence relations, Matching preclusion for cube-connected cycles, Robust multivalued solutions for assignment problems: A note, Approximate congruence in nearly linear time, Eine neue Definition der fastperiodischen Funktionen., A Helly Theorem for Sets, Corrádi and Hajnal's Theorem for Sparse Random Graphs, Incidence properties of cosets in loops, Regularity and Positional Games, Minimum degree thresholds for bipartite graph tiling, Ramsey Numbers for the Pair Sparse Graph-Path or Cycle, Maximal-\(\Gamma\)-prime Graphen, The dynamical look at the subsets of a group, The dimension of random ordered sets, Complexity of a disjoint matching problem on bipartite graphs, On chromatic‐choosable graphs, An extension of Hall's theorem for partitioned bipartite graphs, Stationary random metrics on hierarchical graphs via \((\min,+)\)-type recursive distributional equations, Uniformly Exhaustive Submeasures and Nearly Additive Set Functions, Kernelization – Preprocessing with a Guarantee, Eine neue Definition der fastperiodischen Funktionen, Small Embeddings of Partial Steiner Triple Systems, Methods of solving some personnel-classification problems, On an arithemtical inequality, Unnamed Item, Proportional choosability of complete bipartite graphs, Eternal dominating sets on digraphs and orientations of graphs, On a Generalization of the Ryser-Brualdi-Stein Conjecture, An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves, Unnamed Item, A minimal completion of doubly substochastic matrix, Regular Hypertournaments and Arc-Pancyclicity, Boundary Labeling with Octilinear Leaders, Representation of systems of measurable sets, Matrices of zeros and ones, Hall’s theorem revisited, Rado's theorem for polymatroids, A proof of Sperner's lemma via Hall's theorem, Families of pairs of graphs with a large number of common cards, Minimum cycle bases of graphs on surfaces, An upper bound for the chromatic number of line graphs, Perfect matchings after vertex deletions, New integer linear programming approaches for course timetabling, Pancyclic PBD block-intersection graphs, Crown reductions for the minimum weighted vertex cover problem, Matchings in arbitrary groups., Fixed point sets of deformations of polyhedra with local cut points, On classical and modern marriage problems, A continuous generalization of the transversal property, The women of Cairo: equilibria in large anonymous games, Constraint theory: an overview, Unnamed Item, Well-covered graphs and factors, Unnamed Item, Inapproximability and approximability of maximal tree routing and coloring, List multicoloring problems involving the k-fold Hall numbers, Balanced coloring of bipartite graphs, Expansion and contraction functors on matriods, Existence of perfect matchings in a plane bipartite graph, Shifting: one-inclusion mistake bounds and sample compression, Turán-type results for complete \(h\)-partite graphs in comparability and incomparability graphs, Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees, Construction of Steiner Quadruple Systems Having Large Numbers of Nonisomorphic Associated Steiner Triple Systems, Applications of Menger's graph theorem, Submodular functions and independence structures, Perfect matchings of a graph, Multiple choice tries and distributed hash tables, Derived invariants for surface cut algebras of global dimension 2 II: the punctured case, Transversal theory and the study of abstract independence, Hall's criterion as a 'self-refining' result, Network Games with and without Synchroneity, On the 2-factors of bicubic graphs, Proof Pearl: The Marriage Theorem, Systems of distinct representatives. II, Edge-superconnectivity of semiregular cages with odd girth, Near-automorphisms of Latin squares, Commuting conjugacy classes: an application of Hall's marriage theorem to group theory, Generalized versions of Hall's theorem, On fully indecomposable matrices, Counting Certain Pairings in Arbitrary Groups, Plünnecke's Inequality, Extension of partial diagonals of matrices. I, On a distribution problem in finite and countable sets, Smallest maximal matchings in the graph of the d-dimensional cube, Cycle Extensions in BIBD Block-Intersection Graphs, The rank formula of Nash-Williams as a source of covering and packing theorems, An interpolation theorem for partitions which are complete with respect to hereditary properties, Perfect matchings in regular bipartite graphs, Perfect matchings in balanced hypergraphs, Dimer models and Calabi-Yau algebras, Discrete Gabor frames in $\ell ^2(\mathbb {Z}^d)$, Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders, Variations on Instant Insanity, The intersection of a matroid and a simplicial complex, Rank of adjacency matrices of directed (strongly) regular graphs, On 3-stage Clos networks with different nonblocking requirements on two types of calls, Entropic uncertainty relations and the stabilizer formalism, Typical case complexity of satisfiability algorithms and the threshold phenomenon, Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs, Counting common representatives and symmetric chain decompositions, RECTANGLE AND BOX VISIBILITY GRAPHS IN 3D, The maximum genus, matchings and the cycle space of a graph, Weak subgroupoid lattices, Some Monotonicity Properties of Partial Orders
