<?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 6 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=antichain&amp;p=5">1.Previous</a><br />
<a accesskey="3" href="page.php?w=antichain&amp;p=7">3.Next</a>
</p>
<p>as large as every other antichain. The width of a partially ordered set is the cardinality of a maximum antichain. Any antichain can intersect any chain in at most one element, so, if we can partition the elements of an order into  chains then the width of the order must be at most  (if the antichain has more than  elements, by the <a href="page.php?w=pigeonhole_principle">pigeonhole principle</a>, there would be 2 of its elements belonging to the same chain, a contradiction). <a href="page.php?w=Dilworth%27s_theorem">Dilworth's theorem</a> states</p><p>
<a accesskey="1" href="page.php?w=antichain&amp;p=5">1.Previous</a><br />
<a accesskey="3" href="page.php?w=antichain&amp;p=7">3.Next</a>
</p>

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

</card>
</wml>
