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.
On the number of fixed edges of automorphisms of vertex-transitive graphs of small valency
Grazian V.;
2023
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:
| File | Dimensione | Formato | |
|---|---|---|---|
|
6. fixed edges in graphs of small valency.pdf
accesso aperto
Tipologia:
Published (Publisher's Version of Record)
Licenza:
Creative commons
Dimensione
371.05 kB
Formato
Adobe PDF
|
371.05 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
