Transversals and matroid partition
From MaRDI portal
Publication:5516086
DOI10.6028/jres.069B.016zbMath0141.21801OpenAlexW2084562801MaRDI QIDQ5516086
Publication date: 1965
Published in: Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.6028/jres.069b.016
Related Items
A characterisation of the generic rigidity of 2-dimensional point-line frameworks, Compatible systems of representatives, About a new class of matroid-inducing packing families, Finitary and cofinitary gammoids, Extensions of matroid covering and packing, The \(r\)-depth of a matroid, Fractional matchings and the Edmonds-Gallai theorem, Defining matroids through sequential selection, On matroids induced by packing subgraphs, A Characterisation of Strict Matching Matroids, A Generalisation of the Matroid Lift Construction, Matroids and linking systems, Calibration scheduling with time slot cost, Unnamed Item, Induced graph packing problems, Factorizations of complete multipartite graphs into generalized cubes, A note on list arboricity, Simple push-relabel algorithms for matroids and submodular flows, Elementary strong maps and transversal geometries, Extension of partial diagonals of matrices. II, Tabloides, A generalized-polymatroid approach to disjoint common independent sets in two matroids, On the complexity of packing rainbow spanning trees, Network theory and transversal matroids, Submodular optimization problems and greedy strategies: a survey, Infinite gammoids: minors and duality, Theory of Principal Partitions Revisited, Probabilistic single processor scheduling, Constructing rate \(1/p\) systematic binary quasi-cyclic codes based on the matroid theory, Complementary Trees and Independent Matchings, Fair-by-design matching, An Affine Representation for Transversal Geometries, The Kadison-Singer problem in discrepancy theory., Extending Hall's theorem into list colorings: a partial history, Families of vectors with prescibed rank partition and a prescribed subfamily, Paley graphs have Hamilton decompositions, Two results on the rank partition of a matroid, Matroid intersection algorithms, Another proof of a theorem concerning detachments of graphs, Extensions and presentations of transversal matroids, A short proof that matching matroids are transversal, A Tutte polynomial inequality for lattice path matroids, List Coloring of Two Matroids through Reduction to Partition Matroids, Greedy matching: guarantees and limitations, Poset matching---a distributive analog of independent matching, Lattices related to extensions of presentations of transversal matroids, A New Description of Transversal Matroids Through Rough Set Approach, Transversal matroid intersections and related packings, Growth Rates and Critical Exponents of Classes of Binary Combinatorial Geometries, Matroid base polytope decomposition, Infinite gammoids, Complementary bases of a matroid, On the free matrix representation of transversal geometries, Law of the iterated logarithm for sums of non-linear functions of Gaussian variables that exhibit a long range dependence, Matchings in graphs. II, A maximum-rank minimum-term-rank theorem for matroids, Truncations of principal geometries, The perfectly matchable subgraph polytope of a bipartite graph, On some properties of base-matroids, Matching theorems for combinatorial geometries, A new characterization of the maximum genus of a graph, Kuratowski's and Wagner's theorems for matroids, Matchings in connection with ground delay program planning, A note on binary fundamental transversal matroids, Facial structures of lattice path matroid polytopes, Transversal theory and rank functions, A simple proof that every matroid is an intersection of fundamental transversal matroids, Optimal matroid partitioning problems, Base partition for mixed families of finitary and cofinitary matroids, Complexity of packing common bases in matroids, An extension of Tutte's 1-factor theorem, Applications of Menger's graph theorem, Decomposition of complete graphs into 5‐cubes, On Fundamental Transversal Matroids, Submodular functions and independence structures, The base-matroid and inverse combinatorial optimization problems., Use of matroid theory in operations research, circuits and systems theory, Transversal theory and the study of abstract independence, On a packing problem for infinite graphs and independence spaces, A characterisation of binary transversal structures, The optimal path-matching problem, Structural theorems for submodular functions, polymatroids and polymatroid intersections, The maximum-rank minimum-term-rank theorem for the pivotal transforms of a matrix, Rooted \(k\)-connections in digraphs, A note on the separation problem for the matching matroid, Strong transfinite version of König's duality theorem, Unnamed Item, Extension of partial diagonals of matrices. I, Matroid basis graphs. II, The rank formula of Nash-Williams as a source of covering and packing theorems, Spanning and independence properties of frame partitions, Pfaffian structures and critical problems in finite symplectic spaces, Strong Algorithms for the Ordinal Matroid Secretary Problem, Sufficient regularity conditions for common transversals, Integer Rounding for Polymatroid and Branching Optimization Problems, The Edmonds-Gallai decomposition for matchings in locally finite graphs, An extension of matching theory, A particular class of graphic matroids, List coloring of matroids and base exchange properties, A fast algorithm to construct a representation for transversal matroids, Infinite Matroids, On generalisations of the Aharoni–Pouzet base exchange theorem, Presentations of transversal valuated matroids, Partitioning into common independent sets via relaxing strongly base orderability, Matroid-constrained vertex cover, Results on the algebraic matroid of the determinantal variety, Common Partial Transversals and Integral Matrices, Induced Matroids, Unnamed Item, The structure of Sperner k-families, Tree decomposition, Characterizations of transversal matroids and their presentations, The structure of Sperner k-families, Characterizations of transversal matroids and their presentations
