Matroid matching and some applications
From MaRDI portal
Publication:1144584
DOI10.1016/0095-8956(80)90066-0zbMATH Open0444.05031OpenAlexW2000743971MaRDI QIDQ1144584FDOQ1144584
Authors: László Lovász 
Publication date: 1980
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(80)90066-0
Extremal problems in graph theory (05C35) Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Paths, Trees, and Flowers
- The Factorization of Linear Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Über die Maximalzahl kreuzungsfreier H-Wege
- Title not available (Why is that?)
- Über die Maximalzahl kantendisjunkter A-Wege
- Matroid Intersection
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
- Rado's theorem for polymatroids
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (76)
- The Bhargava greedoid as a Gaussian elimination greedoid
- Generating functions and counting formulas for spanning trees and forests in hypergraphs
- Matroid Intersection under Restricted Oracles
- Representing matroids over the reals is \(\exists \mathbb{R}\)-complete
- Finding Maximum Edge-Disjoint Paths Between Multiple Terminals
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
- Simultaneous feedback edge set: a parameterized perspective
- Iterated parallel union of matroids
- Optimal general factor problem and jump system intersection
- Algebraic algorithms for fractional linear matroid parity via noncommutative rank
- Title not available (Why is that?)
- The work of June Huh
- Edge deletion to tree-like graph classes
- Packing \(A\)-paths in group-labelled graphs via linear matroid parity
- The delta-sum of matching delta-matroids
- A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem
- Feedback vertex set reconfiguration in planar graphs
- Algebraic algorithms for linear matroid parity problems
- Weighted linear matroid parity
- The parity problem of polymatroids without double circuits
- An algorithm for weighted fractional matroid matching
- Randomized algorithms in combinatorial optimization: A survey
- The membership problem in jump systems
- Pseudomatroids
- Optimization problems with color-induced budget constraints
- Spanning trees of 3-uniform hypergraphs
- The linear delta-matroid parity problem
- Approximating bounded degree deletion via matroid matching
- On some combinatorial properties of algebraic matroids
- A unifying approach to descriptive geometry and mechanisms
- A weighted linear matroid parity algorithm
- Matroid matching with Dilworth truncation
- Optimal matroid partitioning problems
- Optimal matroid partitioning problems
- A fast algorithm for the path 2-packing problem
- Title not available (Why is that?)
- Boundary classes for graph problems involving non-local properties
- Slider-pinning rigidity: a Maxwell-Laman-type theorem
- Packing non-zero \(A\)-paths via matroid matching
- Fanout limitations on constraint systems
- Optimal matching forests and valuated delta-matroids
- Tree metrics and edge-disjoint \(S\)-paths
- Source location with rigidity and tree packing requirements
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- The \(d\)-dimensional rigidity matroid of sparse graphs
- The Complexity of Acyclic Subhypergraph Problems
- Finite prime-field characteristic sets for planar configurations
- An appraisal of computational complexity for operations researchers
- Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three
- An algorithm for packing non-zero \(A\)-paths in group-labelled graphs
- Subspace arrangements, graph rigidity and derandomization through submodular optimization
- A parameterized view on matroid optimization problems
- Free multiflows in bidirected and skew-symmetric graphs
- On cycles through prescribed vertices in weakly separable graphs
- An augmenting path algorithm for linear matroid parity
- Singular spaces of matrices and their application in combinatorics
- Multiflows and disjoint paths of minimum total cost
- A polynomial kernel for distance-hereditary vertex deletion
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
- On Finding Hamiltonian Cycles in Barnette Graphs
- On matroid parity and matching polytopes
- Combinatorial auctions with decreasing marginal utilities
- Solving the linear matroid parity problem as a sequence of matroid intersection problems
- Structural properties of matroid matchings
- A short proof of Mader's \(\mathcal S\)-paths theorem
- On the graphic matroid parity problem
- A network theory approach to the rigidity of skeletal structures. I: Modelling and interconnection
- Minimally connected \(r\)-uniform hypergraphs
- A randomized polynomial kernel for subset feedback vertex set
- Packings and 2-packings of A-paths
- Recent developments in discrete convex analysis
- On Some Problems in the Design of Plane Skeletal Structures
- Packing non-returning \(A\)-paths algorithmically
- On enumerating monomials and other combinatorial structures by polynomial interpolation
- A linear programming formulation of Mader's edge-disjoint paths problem
- Coverings and delta-coverings
This page was built for publication: Matroid matching and some applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1144584)
