Maximal Cocliques in the Generating Graphs of the Alternating and Symmetric Groups

preprint2020arXivOpen access

Abstract

The generating graph Γ(G)Γ(G) of a finite group GG has vertex set the non-identity elements of GG, with two elements connected exactly when they generate GG. A coclique in a graph is an empty induced subgraph, so a coclique in Γ(G)Γ(G) is a subset of GG such that no pair of elements generate GG. A coclique is maximal if it is contained in no larger coclique. It is easy to see that the non-identity elements of a maximal subgroup of GG form a coclique in Γ(G)Γ(G), but this coclique need not be maximal. In this paper we determine when the intransitive maximal subgroups of Sn\textrm{S}_n and An\textrm{A}_n are maximal cocliques in the generating graph. In addition, we prove a conjecture of Cameron, Lucchini, and Roney-Dougal [3] in the case of G=AnG = \textrm{A}_n and Sn\textrm{S}_n, when n is prime and n≠(qd−1)(q−1)n \neq \frac{(q^d -1)}{(q-1)} for all prime powers qq and d≥2d \geq 2. Namely, we show that two elements of GG have identical sets of neighbours in Γ(G)Γ(G) if and only if they belong to exactly the same maximal subgroups.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.