Full transversal matroids, strict gammoids, and the matroid components problem

DOI10.1080/03081088608817708zbMATH Open0606.05016OpenAlexW2033912868WikidataQ126249496 ScholiaQ126249496MaRDI QIDQ3744173FDOQ3744173

Authors: Mark S. Mummy 

Publication date: 1986

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081088608817708

Recommendations

• Strict matching matroids and matroid algorithms
• The generalized column incidence graph and a matroid base-listing algorithm
• Linear representation of transversal matroids and gammoids parameterized by rank
• Linear representation of transversal matroids and gammoids parameterized by rank
• scientific article; zbMATH DE number 4025457

zbMATH Keywords

algorithmsGaussian eliminationTutte polynomialtransversal matroiddependence graphsdirected pathsWhitney polynomialstrict gammoid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Gammoids and transversal matroids
• Title not available (Why is that?)
• The dependence graph for bases in matroids
• Matchings in graphs. II
• Complexity of Combinatorial Algorithms

Cited In (6)

• The generalized column incidence graph and a matroid base-listing algorithm
• Strict matching matroids and matroid algorithms
• Undirected strict gammoids
• Linear representation of transversal matroids and gammoids parameterized by rank
• Linear representation of transversal matroids and gammoids parameterized by rank
• On finding some new excluded minors for gammoids

This page was built for publication: Full transversal matroids, strict gammoids, and the matroid components problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3744173)