Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Colour-permuting automorphisms of complete Cayley graphs (2404.09367v1)

Published 14 Apr 2024 in math.CO

Abstract: Let $G$ be a (finite or infinite) group, and let $K_G = \mathrm{Cay} ( G;G \smallsetminus {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 \in G$. We prove that every colour-permuting automorphism of $K_G$ is an affine map, unless $G \cong Q_8 \times B$, where $Q_8$ is the quaternion group of order $8$, and $B$ is an abelian group, such that $b2$ is trivial for all $b \in B$. We also prove (without any restriction on $G$) that every colour-permuting automorphism of $K_G$ 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.

Summary

We haven't generated a summary for this paper yet.