A construction of 2-arc-transitive non-solvable covers of complete graphs
Combinatorics
2026-04-03 v1 Group Theory
Abstract
We construct connected -arc-transitive covers of complete graphs with non-abelian characteristically simple transformation groups. This solves the existence problem for non-solvable -arc-transitive covers of complete graphs.
Cite
@article{arxiv.2604.02316,
title = {A construction of 2-arc-transitive non-solvable covers of complete graphs},
author = {Jiyong Chen and Cai Heng Li and Ci Xuan Wu and Yan Zhou Zhu},
journal= {arXiv preprint arXiv:2604.02316},
year = {2026}
}
Comments
10 pages, accepted for publication in European Journal of Combinatorics