A THEOREM ON INDEPENDENCE RELATIONS

DOI10.1093/qmath/os-13.1.83zbMath0063.06369OpenAlexW2033637560MaRDI QIDQ5845425

Publication date: 1942

Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/qmath/os-13.1.83

Related Items

Packing Steiner trees, Compatible systems of representatives, Identifying restrictions of linear equations with applications to simultaneous equations and cointegration, Reconstructing binary matrices with timetabling constraints, Generalized polymatroids and submodular flows, An application of submodular flows, Matroids and linking systems, On a Generalization of the Ryser-Brualdi-Stein Conjecture, Conditions for matchability in groups and field extensions, Packing of arborescences with matroid constraints via matroid intersection, Rota's basis conjecture for matroids with density close to one, Choice functions, Exponential sums equations and tropical geometry, On Fair Division under Heterogeneous Matroid Constraints, Unified Greedy Approximability beyond Submodular Maximization, Matching subspaces in a field extension., Unified greedy approximability beyond submodular maximization, Simplicial generation of Chow rings of matroids, A Survey on Covering Supermodular Functions, Theory of Principal Partitions Revisited, Colorful linear programming, Nash equilibrium, and pivots, Spanning trees with specified differences in Cayley graphs, Complementary Trees and Independent Matchings, Tropical Kirchhoff's formula and postoptimality in matroid optimization, Greedy algorithms and poset matroids, Matching Theory for Combinatorial Geometries, Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs, Unnamed Item, Multicolored forests in bipartite decompositions of graphs, Rainbow Odd Cycles, The notion and basic properties of \(M\)-transversals, Matching theorems for combinatorial geometries, Independent transversals for countable set systems, On the number of systems of distinct representatives in an independence structure, Unnamed Item, A proof of Rado's theorem via principal extension, Unnamed Item, More on complementary trees, On the intersection of independence systems, Transversal theory and rank functions, Some identification problems in the cointegrated vector autoregressive model, A Structural Approach to State-to-Output Decoupling, Approximation Limitations of Pure Dynamic Programming, Applications of Menger's graph theorem, Systems of representatives, Submodular functions and independence structures, Comments on certain combinatorial theorems of Ford and Fulkerson, Transversal theory and the study of abstract independence, Methods of invariant analysis for linear control systems., Envy-free matchings with one-sided preferences and matroid constraints, Operator scaling: theory and applications, Intersection pairings for higher laminations, Generalized versions of Hall's theorem, The rank formula of Nash-Williams as a source of covering and packing theorems, From output feedback pole-assignment to robust stabilization, Multicolored parallelisms of Hamiltonian cycles, On matchable subsets in abelian groups and their linear analogues, On partitioning two matroids into common independent subsets, Measurable equidecompositions for group actions with an expansion property, Partitioned transversals, Generalized Wong sequences and their applications to Edmonds' problems