On Representatives of Subsets
From MaRDI portal
Publication:4760022
DOI10.1112/JLMS/S1-10.37.26zbMath0010.34503OpenAlexW2063292248WikidataQ56144536 ScholiaQ56144536MaRDI QIDQ4760022
No author found.
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 (only showing first 100 items - show all)
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
This page was built for publication: On Representatives of Subsets
