Matroids with few non-common bases
In this note the author revisits theorems of two of his previous papers, namely [Discrete Math. 240, 271--276 (2001; Zbl 0989.05021)] and [Discrete Math. 270, 193--205 (2003; Zbl 1033.05024)]. The hypotheses for many theorems that appear in these papers are significantly weakened but essentially the same conclusions are derived and the same proofs work, so the proofs are not rewritten in the paper under review. The spirit of the paper is captured in the conjecture at the end: Suppose that \(M_1\) and \(M_2\) are vertically \((k+1)\)-connected matroids on the same ground set \(E\) for some positive integer \(k\). If the cardinality of the differece set of the collection of bases of \(M_1\) and \(M_2\) is at most \(k\), then there either is a matroid \(N\) on \(E\) obtained from \(M_2\) by relaxing a sequence of tip-hyperplanes and \(\mathcal{B}(M_1)-\mathcal{B}(M_2)= \mathcal{B}(N)-\mathcal{B}(M_2)\); or both \(M_1\) and \(M_2\) have rank at most \(k\) and do not have disjoint cocircuits.
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- Connectivity in Matroids
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- Lectures on matroids
- Matroids with many common bases.
- On a matroid generalization of graph connectivity
- ON MATROID CONNECTIVITY
- On matroids with many common bases
- On Mills's conjecture on matroids with many common bases
- On matroids with many common bases
- Matroids with many common bases.
- Finding all common bases in two matroids
- On Disjoint Common Bases in Two Matroids
- A Matroid Reconstruction Result
- Determining the minimum rank of matroids whose basis graph is common
- On Mills's conjecture on matroids with many common bases
- On the number of common bases of two matroids
This page was built for publication: Matroids with few non-common bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2488944)