Transversals and matroid partition
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Rooted \(k\)-connections in digraphs
- The Edmonds-Gallai decomposition for matchings in locally finite graphs
- An extension of matching theory
- Fractional matchings and the Edmonds-Gallai theorem
- On matroids induced by packing subgraphs
- Tabloides
- Network theory and transversal matroids
- Another proof of a theorem concerning detachments of graphs
- A short proof that matching matroids are transversal
- Complementary bases of a matroid
- On the free matrix representation of transversal geometries
- Matchings in graphs. II
- A maximum-rank minimum-term-rank theorem for matroids
- Truncations of principal geometries
- Kuratowski's and Wagner's theorems for matroids
- Transversal theory and rank functions
- A simple proof that every matroid is an intersection of fundamental transversal matroids
- An extension of Tutte's 1-factor theorem
- The optimal path-matching problem
- Pfaffian structures and critical problems in finite symplectic spaces
- Compatible systems of representatives
- A note on list arboricity
- Elementary strong maps and transversal geometries
- Extension of partial diagonals of matrices. II
- The Kadison-Singer problem in discrepancy theory.
- Extensions of matroid covering and packing
- The base-matroid and inverse combinatorial optimization problems.
- Sufficient regularity conditions for common transversals
- The \(r\)-depth of a matroid
- Simple push-relabel algorithms for matroids and submodular flows
- Families of vectors with prescibed rank partition and a prescribed subfamily
- Optimal matroid partitioning problems
- Base partition for mixed families of finitary and cofinitary matroids
- Complexity of packing common bases in matroids
- Calibration scheduling with time slot cost
- Submodular optimization problems and greedy strategies: a survey
- Fair-by-design matching
- Infinite gammoids
- Facial structures of lattice path matroid polytopes
- List coloring of matroids and base exchange properties
- About a new class of matroid-inducing packing families
- A generalized-polymatroid approach to disjoint common independent sets in two matroids
- Constructing rate \(1/p\) systematic binary quasi-cyclic codes based on the matroid theory
- On some properties of base-matroids
- Applications of Menger's graph theorem
- Submodular functions and independence structures
- Transversal theory and the study of abstract independence
- A characterisation of binary transversal structures
- The maximum-rank minimum-term-rank theorem for the pivotal transforms of a matrix
- Strong transfinite version of König's duality theorem
- 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
- A fast algorithm to construct a representation for transversal matroids
- On the complexity of packing rainbow spanning trees
- A characterisation of the generic rigidity of 2-dimensional point-line frameworks
- Spanning and independence properties of frame partitions
- Theory of principal partitions revisited
- Finitary and cofinitary gammoids
- The perfectly matchable subgraph polytope of a bipartite graph
- A particular class of graphic matroids
- Integer Rounding for Polymatroid and Branching Optimization Problems
- Growth Rates and Critical Exponents of Classes of Binary Combinatorial Geometries
- Use of matroid theory in operations research, circuits and systems theory
- A new characterization of the maximum genus of a graph
- On Fundamental Transversal Matroids
- Complementary Trees and Independent Matchings
- An Affine Representation for Transversal Geometries
- Matroid intersection algorithms
- Transversal matroid intersections and related packings
- Law of the iterated logarithm for sums of non-linear functions of Gaussian variables that exhibit a long range dependence
- A Characterisation of Strict Matching Matroids
- Matching theorems for combinatorial geometries
- scientific article; zbMATH DE number 3150 (Why is no real title available?)
- A Generalisation of the Matroid Lift Construction
- Extensions and presentations of transversal matroids
- Factorizations of complete multipartite graphs into generalized cubes
- Strong algorithms for the ordinal matroid secretary problem
- Greedy matching: guarantees and limitations
- Optimal matroid partitioning problems
- List coloring of two matroids through reduction to partition matroids
- A New Description of Transversal Matroids Through Rough Set Approach
- Matchings in connection with ground delay program planning
- Lattices related to extensions of presentations of transversal matroids
- Matroid base polytope decomposition
- Decomposition of complete graphs into 5‐cubes
- scientific article; zbMATH DE number 3298861 (Why is no real title available?)
- Common Partial Transversals and Integral Matrices
- Induced Matroids
- Infinite Matroids
- A note on binary fundamental transversal matroids
- The structure of Sperner k-families
- Characterizations of transversal matroids and their presentations
- Tree decomposition
- The structure of Sperner k-families
- Characterizations of transversal matroids and their presentations
- Matroids and linking systems
- Induced graph packing problems
- On generalisations of the Aharoni–Pouzet base exchange theorem
- Presentations of transversal valuated matroids
This page was built for publication: Transversals and matroid partition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5516086)
