The dependence graph for bases in matroids

DOI10.1016/0012-365X(77)90118-2zbMath0366.05024MaRDI QIDQ1241754

Stein Krogdahl

Publication date: 1977

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

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99) Algorithms in computer science (68W99)

Related Items (37)

An augmenting path algorithm for linear matroid parity ⋮ On unicyclic graphs with uniquely restricted maximum matchings ⋮ Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs ⋮ The generalized column incidence graph and a matroid base-listing algorithm ⋮ Full transversal matroids, strict gammoids, and the matroid components problem ⋮ Strict matching matroids and matroid algorithms ⋮ Unbreakable matroids ⋮ Matroids and linking systems ⋮ Some Small Circuit-Cocircuit Ramsey Numbers for Matroids ⋮ Matroid Intersection under Restricted Oracles ⋮ Unnamed Item ⋮ Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings ⋮ Local maximum stable set greedoids stemming from very well-covered graphs ⋮ Unnamed Item ⋮ Matchings and \(\Delta\)-matroids ⋮ Homogeneous multivariate polynomials with the half-plane property ⋮ Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids ⋮ Obstructions for Bounded Branch-depth in Matroids ⋮ On matroid connectivity ⋮ Budgeted matching and budgeted matroid intersection via the gasoline puzzle ⋮ On Rota's conjecture and excluded minors containing large projective geometries. ⋮ Partial matroid representations ⋮ Multimatroids. III: Tightness and fundamental graphs ⋮ The Minimum Cost Query Problem on Matroids with Uncertainty Areas. ⋮ A notion of cross-perfect bipartite graphs ⋮ A decomposition of the matroids with the max-flow min-cut property ⋮ Pareto Stable Matchings under One-Sided Matroid Constraints ⋮ On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph ⋮ Dependencies among dependencies in matroids ⋮ On the efficiency of representability tests for matroids ⋮ Discrete convex analysis ⋮ On matroids without a non-Fano minor ⋮ Arbres minimaux d'un graphe preordonne ⋮ The excluded minors for GF(4)-representable matroids ⋮ Market Pricing for Matroid Rank Valuations ⋮ A decomposition theory for matroids. I: General results ⋮ Unicycle graphs and uniquely restricted maximum matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel concepts in graph theory
• The asymptotic number of geometries
• Matroid basis graphs. I
• Gammoids and transversal matroids
• Paths, Trees, and Flowers
• Comments on bases in dependence structures

This page was built for publication: The dependence graph for bases in matroids