2000 character limit reached
On the number of fixed edges of automorphisms of vertex-transitive graphs of small valency (2202.11434v1)
Published 23 Feb 2022 in math.CO and math.GR
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\v{z} Poto\v{c}nik and the third author.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
