On partitioning two matroids into common independent subsets (Q2570121)

König's edge-coloring theorem states that the edges of a bipartite graph with maximal degree \(\Delta\) can be decomposed into \(\Delta\) matchings. The authors propose a possible generalization of König's theorem to be as follows: Let \(M_1\) and \(M_2\) be two matroids on \(S\). If no element of \(S\) is \(k+1\)-spanned in either \(M_1\) or \(M_2\), then the system has a common \(k\)-partition. The authors prove this conjecture for the regular case and for \(k=2\).