Matroid union and matroid intersection are closely related in the sense that one can be derived from the other. However they are from different perspectives and have different applications. To motivate matroid union theorem we state a well known theorem of Tutte and Nash-Williams on packing disjoint spanning trees in graphs. Theorem 1 (Nash-Williams and Tutte) An undirected multi-graph G = (V, ...