Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

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)

Thanks!

share|improve this question
1  
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
add comment

Your Answer

 
discard

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

Browse other questions tagged or ask your own question.