MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Math Overflow hi,

I would like to show that Paley graph are rank 3-graphs (i.e Vertex-Transitive, Edge-Transitive and Non-Edge-Transitive).

Showing that they are Vertex transitive is easy - every x |-> x+k is an automorphism in GF(q) and so, for example, the automorphism x|-> x+1 shows that they are vertex transitive.

I also know how to show that they are self-complimentary and thus if I can show on of edge-transitivity/non-edge transitivity I get the other.

Can anyone help with how to show that they are indeed edge-transitive (or non-edge-transitive)


share|cite|improve this question
Use multiplication in $GF(q)$. I'm voting to close because this isn't a research-level question. – Andreas Blass Jul 16 '11 at 16:11
Agree with @Andreas, and especially since the question is poorly worded. – Igor Rivin Jul 16 '11 at 22:34

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.