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 Primož Potočnik and the third author.
Barbieri, M., Grazian, V., Spiga, P. (2022). On the number of fixed edges of automorphisms of vertex-transitive graphs of small valency. JOURNAL OF ALGEBRAIC COMBINATORICS [10.1007/s10801-022-01176-5].
On the number of fixed edges of automorphisms of vertex-transitive graphs of small valency
Grazian, Valentina;Spiga, Pablo
2022
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 Primož Potočnik and the third author.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
