<?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="Comparability - Page 5 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Comparability&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Comparability&amp;p=6">3.Next</a>
</p>
<p>is comparable to  and likewise for incomparability.</p>

<p><big> Comparability graphs </big></p>
<p>The comparability graph of a partially ordered set  has as vertices the elements of  and has as edges precisely those pairs  of elements for which .</p>

<p><big> Classification </big></p>
<p>When <a href="page.php?w=Class_%28set_theory%29">classifying</a> mathematical objects (e.g., <a href="page.php?w=topological_space">topological space</a>s), two criteria are said to be comparable when the objects that obey one criterion constitute a subset of the objects that</p><p>
<a accesskey="1" href="page.php?w=Comparability&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Comparability&amp;p=6">3.Next</a>
</p>

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

</card>
</wml>
