English

Four-Valent Oriented Graphs of Biquasiprimitive Type

Combinatorics 2019-03-01 v1

Abstract

Let OG(4)\mathcal{OG}(4) denote the family of all graph-group pairs (Γ,G)(\Gamma,G) where Γ\Gamma is 4-valent, connected and GG-oriented (GG-half-arc-transitive). Using a novel application of the structure theorem for biquasiprimitive permutation groups of the second author, we produce a description of all pairs (Γ,G)OG(4)(\Gamma, G) \in\mathcal{OG}(4) for which every nontrivial normal subgroup of GG has at most two orbits on the vertices of Γ\Gamma. In particular we show that GG has a unique minimal normal subgroup NN and that NTkN \cong T^k for a simple group TT and k{1,2,4,8}k\in \{1,2,4,8\}. This provides a crucial step towards a general description of the long-studied family OG(4)\mathcal{OG}(4) in terms of a normal quotient reduction. We also give several methods for constructing pairs (Γ,G)(\Gamma, G) of this type and provide many new infinite families of examples, covering each of the possible structures of the normal subgroup NN.

Keywords

Cite

@article{arxiv.1902.10853,
  title  = {Four-Valent Oriented Graphs of Biquasiprimitive Type},
  author = {Nemanja Poznanović and Cheryl E. Praeger},
  journal= {arXiv preprint arXiv:1902.10853},
  year   = {2019}
}
R2 v1 2026-06-23T07:53:42.241Z