<?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="Antichain - Page 7 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=antichain&amp;p=6">1.Previous</a><br />
<a accesskey="3" href="page.php?w=antichain&amp;p=8">3.Next</a>
</p>
<p>that this bound can always be reached: there always exists an antichain, and a partition of the elements into chains, such that the number of chains equals the number of elements in the antichain, which must therefore also equal the width. Similarly, one can define the height of a partial order to be the maximum cardinality of a chain. <a href="page.php?w=Mirsky%27s_theorem">Mirsky's theorem</a> states that in any partial order of finite height, the height equals the smallest number of antichains into which the order may be partitioned.</p>

<p><big> Sperner families </big></p><p>
<a accesskey="1" href="page.php?w=antichain&amp;p=6">1.Previous</a><br />
<a accesskey="3" href="page.php?w=antichain&amp;p=8">3.Next</a>
</p>

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

</card>
</wml>
