On the order of semiregular automorphisms of cubic vertex-transitive graphs

We prove that, if Γ is a finite connected cubic vertex-transitive graph, then either there exists a semiregular automorphism of Γ of order at least 6, or the number of vertices of Γ is bounded above by an absolute constant.

Authors

Pablo Spiga (ORCID: https://orcid.org/0000-0002-0157-7405)
Valentina Grazian (ORCID: https://orcid.org/0000-0002-0834-1593)
Marco Barbieri

Publication Details

Journal: European Journal of Combinatorics
Published: 2024-11-26
DOI: https://doi.org/10.1016/j.ejc.2024.104091
Primary Topic: Finite Group Theory Research
Type: article
Field-Weighted Citation Impact: 0.00

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

On the order of semiregular automorphisms of cubic vertex-transitive graphs

Pablo Spiga, Valentina Grazian, Marco Barbieri

Nov 26, 2024

European Journal of Combinatorics

Finite Group Theory Research

article

On the order of semiregular automorphisms of cubic vertex-transitive graphs

Pablo Spiga, Valentina Grazian, Marco Barbieri

November 26, 2024article en

Abstract

European Journal of CombinatoricsVol. 124

Openalex Percentile: Top 61%

Finite Group Theory Research

DOI Open Access PDF OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

On the order of semiregular automorphisms of cubic vertex-transitive graphs — Pablo Spiga, Valentina Grazian, et al. · European Journal of Combinatorics (2024) | TGRS Research Map | TGRS