Cayley graphs with few automorphisms

Paul-Henry Leemann , Mikael de La Salle (1)

1 UMPA-ENSL - Unité de Mathématiques Pures et Appliquées

We show that every finitely generated group G with an element of order at least 5 rank(G)^12 admits a locally finite directed Cayley graph with automorphism group equal to G. If moreover G is not generalized dihedral, then the above Cayley directed graph does not have bigons. On the other hand, if G is neither generalized dicyclic nor abelian and has an element of order at least 1.41 · 10^19 rank(G)^132 , then it admits an undirected Cayley graph with automorphism group equal to G. This extends classical results for finite groups and free products of groups. The above results are obtained as corollaries of a stronger form of rigidity which says that the rigidity of the graph can be observed in a ball of radius 2 around a vertex. This strong rigidity result also implies that the Cayley (di)graph covers very few (di)graphs. In particular, we obtain Cayley graphs of Tarski monsters which essentially dot not cover other quasi-transitive graphs. We also show that a group admits a labeled unoriented Cayley graph with automorphism group equal to itself if and only if it is neither generalized dicyclic nor abelian with an element of order greater than 2.

Domaines: Combinatoire [math.CO]; Théorie des groupes [math.GR]

Paul-Henry Leemann, Mikael de La Salle. Cayley graphs with few automorphisms. Journal of Algebraic Combinatorics, 2020, ⟨10.1007/s10801-020-00956-1⟩. ⟨hal-01950331⟩