<?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="Fagin&#039;s theorem - Page 4 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Fagin's_theorem&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Fagin%27s_theorem&amp;p=5">3.Next</a>
</p>
<p>to be interpreted as the sets of vertices colored with the 3 colors, and E(v, w) is to be interpreted as saying the vertices v, w share an edge. The formula then states that no two adjacent vertices have the same color.</p>

<p>Note that there is no need to explicitly enforce each vertex to have exactly 1 color, just at least 1 color. Since, if we allow more than 1 color per vertex, and no two adjacent vertices have the same color, then we certainly can have each vertex to have exactly 1 color, and still no two adjacent vertices have the same</p><p>
<a accesskey="1" href="page.php?w=Fagin's_theorem&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Fagin%27s_theorem&amp;p=5">3.Next</a>
</p>

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

</card>
</wml>
