The main result of this paper is that, if Γ is a finite connected 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 vertices. As a corollary, we get a similar result for 3-valent vertex-transitive graphs.
Potocnik, P., Spiga, P. (2021). On the Number of Fixed Points of Automorphisms of Vertex-Transitive Graphs. COMBINATORICA, 41(5), 703-747 [10.1007/s00493-020-4509-y].
On the Number of Fixed Points of Automorphisms of Vertex-Transitive Graphs
Spiga P.
2021
Abstract
The main result of this paper is that, if Γ is a finite connected 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 vertices. As a corollary, we get a similar result for 3-valent vertex-transitive graphs.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
Spiga-2020-Combinatorica-preprint.pdf
accesso aperto
Descrizione: Original Article
Tipologia di allegato:
Submitted Version (Pre-print)
Licenza:
Creative Commons
Dimensione
422.61 kB
Formato
Adobe PDF
|
422.61 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.