Colour-permuting automorphisms of complete Cayley graphs

Abstract

Let G be a (finite or infinite) group, and let KG = Cay ( G;G \1\ ) be the complete graph with vertex set G, considered as a Cayley graph of G. Being a Cayley graph, it has a natural edge-colouring by sets of the form \s, s-1\ for s ∈ G. We prove that every colour-permuting automorphism of KG is an affine map, unless G Q8 × B, where Q8 is the quaternion group of order 8, and B is an abelian group, such that b2 is trivial for all b ∈ B. We also prove (without any restriction on G) that every colour-permuting automorphism of KG is the composition of a group automorphism and a colour-preserving graph automorphism. This was conjectured by D.P.Byrne, M.J.Donner, and T.Q.Sibley in 2013.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…