<?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="Paley graph - Page 4 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Paley_graph&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Paley_graph&amp;p=5">3.Next</a>
</p>
<p>Rényi) as a way of constructing <a href="page.php?w=tournament_%28graph_theory%29">tournaments</a> with a property previously known to be held only by random tournaments: in a Paley digraph, every small <a href="page.php?w=subset">subset</a> of vertices is dominated by some other vertex.</p>

<p><big> Definition </big></p>
<p>Let q be a <a href="page.php?w=prime_power">prime power</a> such that . That is, q should either be an arbitrary power of a prime congruent to 1&nbsp;mod&nbsp;4 (a <a href="page.php?w=Pythagorean_prime">Pythagorean prime</a>) or</p><p>
<a accesskey="1" href="page.php?w=Paley_graph&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Paley_graph&amp;p=5">3.Next</a>
</p>

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

</card>
</wml>
