Basis pair graphs of transversal matroids are connected

DOI10.1016/0012-365X(89)90267-7zbMath0663.05058MaRDI QIDQ1114716

Martin Farber

Publication date: 1989

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

matroidtransversal matroidsbasis pair graph

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)

Related Items (7)

On Serial Symmetric Exchanges of Matroid Bases ⋮ Serial exchanges in matroids ⋮ Weighted exchange distance of basis pairs ⋮ Exchange Distance of Basis Pairs in Split Matroids ⋮ Bases-cobases graphs and polytopes of matroids ⋮ Edge-disjoint minimum-weight connected spanning \(k\)-edge subgraphs in a weighted graph: A connectedness theorem ⋮ On the basis pair graphs of signed-graphic matroids

Cites Work

• Unnamed Item
• Some properties of basic families of subsets
• An exchange theorem for bases of matroids
• Matroid basis graphs. I
• Matroid basis graphs. II
• Edge‐disjoint spanning trees: A connectedness theorem
• An Exchange Theorem for Independence Structures
• An Affine Representation for Transversal Geometries
• Decomposing symmetric exchanges in matroid bases
• On the Tree Graph of a Matroid
• A Multiple Exchange Property for Bases

This page was built for publication: Basis pair graphs of transversal matroids are connected