Paley graph

From Wikipedia, the free encyclopedia

Paley graph

The Paley graph of order 13
Named after Raymond Paley
Properties Strongly regular
This box: view • talk • edit

In mathematics, and specifically graph theory, Paley graphs, named after Raymond Paley, are dense undirected graphs constructed from the members of a suitable finite field by connecting pairs of elements that differ in a quadratic residue. The Paley graphs form an infinite family of conference graphs, which yield an infinite family of symmetric conference matrices. Paley graphs allow graph-theoretic tools to be applied to the number theory of quadratic residues, and have interesting properties that make them useful in graph theory more generally.

Paley digraphs are directed analogs of Paley graphs that yield antisymmetric conference matrices.

Contents

[edit] Definition

Let q be a prime power such that q\equiv 1 \pmod{4}. Note that this implies that the unique finite field of order q, \mathbb{F}_q, has a square root of -1.

Now let V=\mathbb{F}_q and E=\{\{a,b\}\in \mathbb{F}_q\times\mathbb{F}_q|(a-b)\in (\mathbb{F}_q^{\times})^2 \}. This set is well defined since a-b = -1(b-a), and since -1 is a square, it follows that a-b is a square if and only if b-a is a square.

By definition G=(V,E) is the Paley graph of order q.

[edit] Example

For q = 13, the field \mathbb{F}_q is just integer arithmetic modulo 13. The numbers with square roots mod 13 are:

  • ±1 (square roots ±1 for +1, ±5 for -1)
  • ±3 (square roots ±4 for +3, ±6 for -3)
  • ±4 (square roots ±2 for +4, ±3 for -4)

Thus, in the Paley graph, we form a vertex for each of the integers in the range [0,12], and connect each such integer x to six neighbors: x ± 1 (mod 13), x ± 3 (mod 13), and x ± 4 (mod 13).

[edit] Properties

  • The Paley graphs are self-complementary: the complement of any Paley graph is isomorphic to itself, e.g. via the mapping that takes a vertex x to xk (mod q), where k is any nonresidue mod q.
  • The eigenvalues of Paley graphs are \frac{q-1}{2} (with multiplicity 1) and \frac{-1 \pm \sqrt{q}}{2} (both with multiplicity \frac{q-1}{2}).
  • Paley graphs are quasi-random (Chung et al. 1989): the number of times each possible constant-order graph occurs as a subgraph of a Paley graph is (in the limit for large q) the same as for random graphs, and large sets of vertices have approximately the same number of edges as they would in random graphs.

[edit] Applications

  • The Paley graph of order 17 is the unique largest graph G such that neither G nor its complement contains a complete 4-vertex subgraph (Evans et al. 1981). It follows that the Ramsey number R(4,4) = 18.
  • The Paley graph of order 101 is currently the largest known graph G such that neither G nor its complement contains a complete 6-vertex subgraph.

[edit] Paley digraphs

Let q be a prime power such that q\equiv 3 \pmod{4}. Thus, the finite field of order q, \mathbb{F}_q, has no square root of −1. Consequently, for each pair (a,b) of distinct elements of \mathbb{F}_q, either a − b or b − a, but not both, is a square. The Paley digraph is the directed graph with vertex set V=\mathbb{F}_q and arc set A = \{(a,b)\in \mathbb{F}_q\times\mathbb{F}_q \mid b-a\in (\mathbb{F}_q^{\times})^2 \}.

The Paley digraph is a tournament because each pair of distinct vertices is linked by an arc in one and only one direction.

The Paley digraph leads to the construction of some antisymmetric conference matrices.

[edit] Genus

The six neighbors of each vertex in the Paley graph of order 13 are connected in a cycle; that is, the graph is locally cyclic. Therefore, this graph can be embedded as a Whitney triangulation of a torus, in which every face is a triangle and every triangle is a face. More generally, if any Paley graph of order q could be embedded so that all its faces are triangles, we could calculate the genus of the resulting surface via the Euler characteristic as (q2 − 13q + 24) / 24. Mohar (2005) conjectures that the minimum genus of a surface into which a Paley graph can be embedded is near this bound in the case that q is a square, and questions whether such a bound might hold more generally. Specifically, Mohar conjectures that the Paley graphs of square order can be embedded into surfaces with genus

(q^2 - 13q + 24)(\frac1{24} + o(1)),

where the o(1) term can be any function of q that goes to zero in the limit as q goes to infinity.

White (2001) finds embeddings of the Paley graphs of order q ≡ 1 (mod 8) that are highly symmetric and self-dual, generalizing a natural embedding of the Paley graph of order 9 as a 3×3 square grid on a torus. However the genus of White's embeddings is higher by approximately a factor of three than Mohar's conjectured bound.

[edit] References

  • Baker, R. D.; Ebert, G. L.; Hemmeter, J.; Woldar, A. J. (1996). "Maximal cliques in the Paley graph of square order". J. Statist. Plann. Inference 56: 33–38. doi:10.1016/S0378-3758(96)00006-7. 
  • Broere, I.; Döman, D.; Ridley, J. N. (1988). "The clique numbers and chromatic numbers of certain Paley graphs". Quaestiones Math. 11: 91–93. 
  • Evans, R. J.; Pulham, J. R.; Sheehan, J. (1981). "On the number of complete subgraphs contained in certain graphs". Journal of Combinatorial Theory, Series B 30: 364–371. doi:10.1016/0095-8956(81)90054-X. 
  • Sasakura, Nobuo; Enta, Yoichi; Kagesawa, Masataka (1993). "Construction of rank two reflexive sheaves with similar properties to the Horrocks-Mumford bundle". Proc. Japan Acad., Ser. A 69 (5): 144–148. 
  • White, A. T. (2001). "Graphs of groups on surfaces". Interactions and models, Amsterdam: North-Holland Mathematics Studies 188. 

[edit] External links