On finite edge-primitive and edge-quasiprimitive graphs
Michael Giudici, Cai Heng Li

TL;DR
This paper systematically analyzes edge-primitive and edge-quasiprimitive graphs using the O'Nan--Scott Theorem, classifying possible group actions and providing numerous examples, including all such graphs with almost simple groups of socle PSL(2,q).
Contribution
It offers a comprehensive classification of edge-primitive and edge-quasiprimitive graphs based on group actions, extending understanding of their structure and examples.
Findings
Classified possible edge and vertex actions for such graphs.
Provided numerous explicit examples of edge-primitive graphs.
Determined all G-edge-primitive graphs for G with socle PSL(2,q).
Abstract
Many famous graphs are edge-primitive, for example, the Heawood graph, the Tutte--Coxeter graph and the Higman--Sims graph. In this paper we systematically analyse edge-primitive and edge-quasiprimitive graphs via the O'Nan--Scott Theorem to determine the possible edge and vertex actions of such graphs. Many interesting examples are given and we also determine all -edge-primitive graphs for an almost simple group with socle .
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.
Taxonomy
TopicsFinite Group Theory Research · Advanced Graph Theory Research · graph theory and CDMA systems
