On the number of fixed edges of automorphisms of vertex-transitive graphs of small valency
Abstract
We prove that, if is a finite connected 3-valent vertex-transitive, or 4-valent vertex- and edge-transitive graph, then either is part of a well-understood family of graphs, or every non-identity automorphism of fixes at most 1/3 of the edges. This answers a question proposed by Primoz Potocnik and the third author.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.