A construction of 2-arc-transitive non-solvable covers of complete graphs
Jiyong Chen, Cai Heng Li, Ci Xuan Wu, Yan Zhou Zhu

TL;DR
This paper constructs specific 2-arc-transitive covers of complete graphs with non-abelian simple groups, addressing an open problem in graph symmetry and group actions.
Contribution
It provides the first known construction of non-solvable 2-arc-transitive covers of complete graphs, solving an important existence question.
Findings
Constructed connected 2-arc-transitive covers with non-abelian simple groups.
Solved the existence problem for non-solvable 2-arc-transitive covers.
Advances understanding of symmetry in graph covers.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
