Abstract
Given a permutation group G, the derangement graph ΓG of G is the Cayley graph with connection set the set of all derangements of G. We prove that, when G is transitive of degree at least 3, ΓG contains a triangle.The motivation for this work is the question of how large can be the ratio of the independence number of ΓG to the size of the stabilizer of a point in G. We give examples of transitive groups where this ratio is maximum.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
