Equicovering matroids by distinct bases (Q1891366): Difference between revisions

Let \(M\) be a matroid on the set \(E\) of \(m\) elements and suppose that the rank \(r(E)\) divides \(m\). Then \(E\) can be partitioned into distinct bases iff \(| X|/ r(X)\leq m/r(E)\) holds for all \(X\subseteq E\). The cyclic order conjecture (see \textit{Y. Kajitani}, \textit{S. Ueno} and \textit{H. Miyano} [Discrete Math. 72, No. 1-3, 187-194 (1988; Zbl 0657.05018)]) states that in this case the elements of \(E\) can be cyclically ordered so that any \(r(E)\) consecutive elements \((\text{mod } m)\) form a base of \(M\). The authors prove that if \(k\leq r(M)< m\) or if \(k= 1\) and \(r(M)= m\) then a necessary and sufficient condition for the existence of \(p\) distinct bases of \(M\) so that each element of \(E\) is covered exactly \(k\) times is that the above inequality and \(k\cdot m= p\cdot r(M)\) hold. This is weaker than the conjecture (put \(p= m\), \(k= r(E)\)) but may be useful for its proof.