Finite transitive permutation groups and bipartite vertex-transitive graphs (Q1409626): Difference between revisions

Let \(G\) be a permutation group acting on a set \(\Omega\). \(G\) is called quasiprimitive if any nontrivial normal subgroup of \(G\) acts transitively on \(\Omega\). By definition, \(G\) is called bi-quasiprimitive if \(G\) is not quasiprimitive but has the property that each nontrivial normal subgroup has at most two orbits on \(\Omega\). As a main result of the paper a structure theorem for finite bi-quasiprimitive permutation groups analogous to the O'Nan-Scott theorem for finite primitive groups and the author's theorem for quasiprimitive groups is established. The newly introduced concept and this structure theorem are applied to the study of finite connected bipartite graphs \(\Gamma\) having an automorphism group \(G\) which is arc transitive and vertex bi-quasiprimitive. A further application towards proving a conjecture by \textit{R. Weiss} [Algebraic methods in graph theory, Vol. II, Conf. Szeged 1978, Colloq. Math. Soc. János Bolyai 25, 827-847 (1978; Zbl 0475.05040)] is given in Proposition 4.1.