Base orderable matroid
Brualdi [1] showed that all matroids satisfy the following property: for any two bases B1 and B2 there is a bijection f:B1→B2 with the property that B1−e+f(e) is a base for any e∈B1.
A matroid is weakly base orderable if for any two bases B1 and B2 there is a bijection f:B1→B2 with the property that B1−e+f(e) and B2−f(e)+e are bases for any e∈B1.
A matroid is strongly base orderable if for any two bases B1 and B2 there is a bijection g:B1→B2 with the property that (B1∖X)∪g(X) is a base for any X⊆B1.
Examples
- Every gammoid is strongly base orderable
- The matroid P7 is strongly base orderable but not a gammoid (see [2] page 128)
- The matroid P8 is weakly base orderable but not strongly base orderable
- The cycle matroid of K4 is not weakly base orderable
Properties
Davies and McDiarmid [3] showed the following:
Theorem. If M1=(S,F1) and M2=(S,F2) are strongly base orderable matroids, and S can be partitioned into k independent subsets both in M1 and in M2, then S can be partitioned into k common independent sets of M1 and M2.
References
- ↑ Brualdi, R.A., Comments on bases in dependence structures, Bull. of the Australian Math. Soc. 1 (1969), 161–167, DOI link
- ↑ A.W. Ingleton, Transversal matroids and related structures, DOI link
- ↑ J. Davies and C. Mcdiarmid, Disjoint common transversals and exchange structures, J. London Math. Soc. 14 (1976), 55–62.DOI link.