ber of elements.</em></p><p><strong>Theorem 2</strong>. <em>Any two spanning trees of a connected graph have the same number of edges.</em></p><p>Matroid theory provides a unifying framework for these results. They are both direct consequences of the fact that, in a matroid, any two maximum-size independet sets have the same cardinality.</p></article><nav class="docs-footer"><a class="docs-footer-prevpage" href="../design/">« Module Design</a><a class="docs-footer-nextpage" href="../functions/">Types/Funct