On the number of common bases of two matroids

DOI10.1016/0012-365X(83)90038-9zbMath0541.05018OpenAlexW2070835108MaRDI QIDQ794657

A. Zemirline, Jean Fonlupt

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0012-365x(83)90038-9

zbMATH Keywords

basesbipartite matchingdirected spanning treesindex of decomposition

Mathematics Subject Classification ID

Trees (05C05) Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Generalized polymatroids and submodular flows ⋮ A note on line digraphs and the directed max-cut problem ⋮ Bases-cobases graphs and polytopes of matroids ⋮ An extension of elementary bipartite graphs to matroid pairs and its characterization

Cites Work

• State Constraints in Convex Control Problems of Bolza
• Matroids and the greedy algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of common bases of two matroids