<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Matroid minor - Page 5 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=matroid_minor&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=matroid_minor&amp;p=6">3.Next</a>
</p>
<p>to the family. A matroid belongs to the family if and only if it does not have a forbidden matroid as a minor. Often, but not always, the set of forbidden matroids is finite, paralleling the <a href="page.php?w=Robertson-Seymour_theorem">Robertson-Seymour theorem</a> which states that the set of forbidden minors of a minor-closed graph family is always finite.</p>

<p>An example of this phenomenon is given by the <a href="page.php?w=regular_matroid">regular matroid</a>s, matroids that are representable over all fields. Equivalently a matroid</p><p>
<a accesskey="1" href="page.php?w=matroid_minor&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=matroid_minor&amp;p=6">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
