On the number of fixed edges of automorphisms of vertex-transitive graphs of small valency

Abstract

We prove that, if $\Gamma$ is a finite connected $3$-valent vertex-transitive, or $4$-valent vertex- and edge-transitive graph, then either $\Gamma$ is part of a well-understood family of graphs, or every non-identity automorphism of $\Gamma$ fixes at most $1/3$ of the edges. This answers a question proposed by Primož Potočnik and the third author.

14 pages

Cited by in corpus (2)

• Vertex-primitive digraphs with large fixity
• On the order of semiregular automorphisms of cubic vertex-transitive graphs