Colour-permuting automorphisms of complete Cayley graphs
arXiv:2404.09367
Abstract
Let be a (finite or infinite) group, and let be the complete graph with vertex set , considered as a Cayley graph of . Being a Cayley graph, it has a natural edge-colouring by sets of the form for . We prove that every colour-permuting automorphism of is an affine map, unless , where is the quaternion group of order , and is an abelian group, such that is trivial for all . We also prove (without any restriction on ) that every colour-permuting automorphism of 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.
16 pages, no figures. Version 2 corrected a formatting error in the arxiv abstract