Reinforcing a Matroid to Have k Disjoint Bases
Reinforcing a Matroid to Have k Disjoint Bases
Let denote the maximum number of disjoint bases in a matroid . For a connected graph , let , where is the cycle matroid of . The well-known spanning tree packing theorem of Nash-Williams and Tutte characterizes graphs with . Edmonds generalizes this theorem to matroids. In [1] and [2], …