On 2-arc-transitive graphs of order kp^n
classification
🧮 math.CO
math.GR
keywords
arc-transitiveordergraphsprimetherevalentconderexist
read the original abstract
We show that there exist functions $c$ and $g$ such that, if $k$, $n$ and $d$ are positive integers with $d> g(n)$ and $\Gamma$ is a $d$-valent $2$-arc-transitive graph of order $kp^n$ with $p$ a prime, then $p\leqslant kc(d)$. In other words, there are only finitely many $d$-valent 2-arc-transitive graphs of order $kp^n$ with $d>g(n)$ and $p$ prime. This generalises a recent result of Conder, Li and Poto\v{c}nik.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.