On the number of fixed points of automorphisms of vertex-transitive graphs of bounded valency
Abstract
The main result of this paper is that, if is a finite connected 4-valent arc-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 vertices. As a corollary, we get a similar result for 3-valent vertex-transitive graphs. Based on these results we propose a conjecture on the number of fixed points of non-identity automorphisms of vertex-transitive graphs of bounded valency.
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.