The Paley graphs of order (where is a prime number congruent to ) is a graph in which the vertices are the numbers from 0 to and two vertices are adjacent if their difference is a quadratic residue modulo .
Many of the known lower bounds on Ramsey numbers come from examples of circulant graphs that have small maximum cliques and small maximum independent sets [REF].