alphaFeedback

WorksMathematics

Chordality of Enhanced Power Graphs of Finite Simple Groups: A Resolution of a Conjecture

AI contributions
Not recorded for this paper
View details

Abstract

The enhanced power graph \PE(G) of a finite group GG has vertex set GG, two elements being adjacent if and only if they generate a cyclic subgroup. We determine the finite simple groups GG for which \PE(G) is chordal: they are the cyclic groups of prime order, \Alt(7), \PSL_2(q) (q≥4q\ge4), \Sz(q) (q=22n+1≥8q=2^{2n+1}\ge8) and \PSL_3(4). This answers an open problem of Bubboloni, Fumagalli and Praeger \cite{BFP}. We also prove that for every finite group GG, if the power graph P(G)P(G) is a cograph (resp.\ chordal) then so is \PE(G); the cograph case is a conjecture of Bubboloni, Fumagalli and Praeger \cite{BFP}.

Introduction

For a finite group GG, the power graph P(G)P(G) joins x,yx,y when one lies in the cyclic group generated by the other, and the enhanced power graph PE(G)P_E(G) joins x,yx,y when ⟨x,y⟩\langle x,y\rangle is cyclic; thus P(G)⊆PE(G)P(G) \subseteq P_E(G), with equality if and only if every element has prime-power order (EPPO groups) [1]. A graph is a cograph if it has no induced path P4P_4, and chordal if it has no induced cycle of length ≥4\ge4.

Forbidden subgraph characterizations provide a powerful structural framework for investigating graphs defined on groups, revealing how the algebraic properties of a group govern the combinatorial structure of its associated graph. Forbidden induced subgraphs in P(G)P(G) have been studied by Manna–Cameron–Mehatari [13], Cameron–Manna–Mehatari [4] (simple groups with cograph power graph), Manna–Mehatari [15] and Brachter–Kaja [2] (simple groups with chordal power graph), Manna–Mandal–Lucchini [14] (claw-free power graph); the nilpotent case for PE(G)P_E(G) is due to Ma–Zahirović–Lv–She [16]. Recently Bubboloni, Fumagalli and Praeger [3] proved that if PE(G)P_E(G) is a cograph then it is chordal, classified the nonabelian simple groups with cograph PE(G)P_E(G) (namely PSL⁡2(q)\operatorname{PSL}_2(q), q≥4q \ge4, PSL⁡3(4)\operatorname{PSL}_3(4) and Sz⁡(q)\operatorname{Sz}(q)), showed that PE(Alt⁡(7))P_E(\operatorname{Alt}(7)) is chordal but not a cograph, and posed the problem of determining the simple groups with chordal PE(G)P_E(G). Moreover, in [7 §7] (see also [17]) the Kourovka problem 21.24 (P(G)P(G) cograph ⇒P(G)\Rightarrow P(G) chordal) is solved, and the conjecture of [3] that P(G)P(G) cograph implies PE(G)P_E(G) cograph is recorded as open.

This paper makes two contributions.

Theorem 1.1 (Classification). Let GG be a finite simple group. Then PE(G)P_E(G) is chordal if and only if GG is isomorphic to one of: a cyclic group of prime order; Alt⁡(7)\operatorname{Alt}(7); PSL⁡2(q)\operatorname{PSL}_2(q) with q≥4q \ge4 (this includes Alt⁡(5)\operatorname{Alt}(5), Alt⁡(6)\operatorname{Alt}(6), PSL⁡3(2)\operatorname{PSL}_3(2)); Sz⁡(q)\operatorname{Sz}(q) with q=22n+1≥8q=2^{2n+1} \ge8; PSL⁡3(4)\operatorname{PSL}_3(4).

Theorem 1.2 (Lifting). Let GG be a finite group. If P(G)P(G) is a cograph then PE(G)P_E(G) is a cograph; if P(G)P(G) is chordal then PE(G)P_E(G) is chordal.

Together with [3] and [7, 17] we obtain, for every finite group GG,

P(G) cograph⟹PE(G) cograph⟹PE(G) chordal,P(G) cograph⟹P(G) chordal⟹PE(G) chordal.P(G)\text{ cograph} \Longrightarrow P_E(G)\text{ cograph} \Longrightarrow P_E(G)\text{ chordal},\quad P(G)\text{ cograph} \Longrightarrow P(G)\text{ chordal} \Longrightarrow P_E(G)\text{ chordal}.

The principal contribution: By [3 Theorem B], the groups PSL⁡2(q)\operatorname{PSL}_2(q), PSL⁡3(4)\operatorname{PSL}_3(4), Sz⁡(q)\operatorname{Sz}(q) have cograph, hence chordal, PE(G)P_E(G), and Alt⁡(7)\operatorname{Alt}(7) is chordal; so the sufficiency half of Theorem 1.1 is already contained in [3] (we include direct proofs for completeness; Alt⁡(5)\operatorname{Alt}(5), Alt⁡(6)\operatorname{Alt}(6), Alt⁡(7)\operatorname{Alt}(7), PSL⁡3(4)\operatorname{PSL}_3(4) also follow from [2 Theorem 1.1] and Theorem 1.2). The new content is the necessity: every other simple group has non-chordal PE(G)P_E(G), which answers the chordal part of Open Problem 1 of [3]; in particular Alt⁡(7)\operatorname{Alt}(7) is the only simple group with chordal but non-cograph PE(G)P_E(G). Theorem 1.2 proves, for all finite groups, the cograph conjecture of [3], and its chordal version. The converses fail: PE(C30)P_E(C_{30}) is complete, whereas P(C30)P(C_{30}) is not chordal (the elements of orders 6, 2, 10, 5, 15, 3 induce a C6C_6, since adjacency in P(C30)P(C_{30}) is divisibility of orders); and P(Z12)P(\mathbb{Z}_{12}) is not a cograph (elements 3, 6, 2, 4 of orders 4, 2, 6, 3 induce a P4P_4) while PE(Z12)P_E(\mathbb{Z}_{12}) is complete. Within simple groups, PSL⁡2(59)\operatorname{PSL}_2(59) contains a cyclic subgroup of order 30, so P(PSL⁡2(59))P(\operatorname{PSL}_2(59)) is not chordal, while PE(PSL⁡2(59))P_E(\operatorname{PSL}_2(59)) is chordal (Prop. 4.1).

The negative half rests on one mechanism (Lemma 2.5): commuting elements x,yx,y of coprime prime-power orders with neither ⟨x⟩\langle x\rangle normal in CG(y)C_G(y) nor ⟨y⟩\langle y\rangle normal in CG(x)C_G(x) yield an induced even cycle; the positive half on a perfect elimination ordering by vertices lying in a unique maximal cyclic subgroup.

Organization: Section 2 collects fundamental concepts and results, Section 3 proves Theorem 1.2, Sections 4 and 5 treat chordal and non-chordal families, Section 6 assembles the proof of Theorem 1.1, and Section 7 records computer checks using GAP 4.12. Section 8 summarizes some well-known results and standard facts.

Preliminary Results

Throughout, we use the symbol xcx^c to mean xc=cxc−1x^c=cxc^{-1}. We write x∼Pyx\sim_P y if x≠yx\ne y and (x∈⟨y⟩(x\in\langle y\rangle or y∈⟨x⟩)y\in\langle x\rangle), and x∼Eyx\sim_E y if x≠yx\ne y and ⟨x,y⟩\langle x,y\rangle is cyclic. If x∈⟨y⟩x\in\langle y\rangle then ⟨x,y⟩=⟨y⟩\langle x,y\rangle=\langle y\rangle, so ∼P⊆∼E\sim_P\subseteq\sim_E, and every non-edge of PE(G)P_E(G) is a non-edge of P(G)P(G). We write A⋬BA\ntrianglelefteq B for “AA is not normal in BB”.

Lemma 2.1 (Subgroups and quotients). (a) If H≤GH\le G then PE(H)P_E(H) is the induced subgraph of PE(G)P_E(G) on HH; so if HH is not chordal, neither is GG.

(b) If N⊴GN\trianglelefteq G, H≤GH\le G and H∩N=1H\cap N=1, then H≅HN/N≤G/NH\cong HN/N\le G/N; so if HH is not chordal, neither is G/NG/N.

Proof. Adjacency depends only on ⟨x,y⟩\langle x,y\rangle, giving (a); (b) is the isomorphism theorem and (a). □\square

Lemma 2.2 (Universal vertex). The identity is adjacent to every vertex, so it lies on no induced cycle of length ≥4\ge4; PE(G)P_E(G) is chordal if and only if PE(G)−{1}P_E(G)-\{1\} is.

Lemma 2.3 (EPPO groups [1]). If every element of GG has prime-power order, then PE(G)=P(G)P_E(G)=P(G) and it is chordal.

Proof. If ⟨x,y⟩\langle x,y\rangle is cyclic of prime-power order its subgroups form a chain, so x∼Pyx\sim_P y or x=yx=y. Let CC be an induced cycle of length ≥4\ge4 and x∈Cx\in C of maximal order; its neighbours on CC are comparable with xx and have order ≤∣x∣\le\lvert x\rvert, so lie in ⟨x⟩\langle x\rangle; subgroups of a cyclic pp-group form a chain, so they are adjacent, a contradiction. □\square

Lemma 2.4 (Simplicial elimination [8]). A vertex is simplicial if its closed neighbourhood is a clique. If the vertices can be ordered v1,…,vnv_1,\ldots,v_n so that each viv_i is simplicial in the subgraph induced on {vi,…,vn}\{v_i,\ldots,v_n\}, the graph is chordal. In PE⁡(G)\operatorname{PE}(G) the closed neighbourhood of xx is the union of the cyclic subgroups containing xx; if xx lies in a unique maximal cyclic subgroup MM then N[x]=MN[x]=M and xx is simplicial.

Proof. Let CC be an induced cycle of length ≥4\ge4 and viv_i its first vertex in the order. Its two neighbours on CC lie in {vi,…,vn}\{v_i,\ldots,v_n\} and are non-adjacent, so viv_i is not simplicial there.

Lemma 2.5 (Coprime commuting pairs). Let x,y∈Gx,y\in G commute and have coprime prime-power orders ra,sbr^a,s^b. If ⟨x⟩≰CG(y)\langle x\rangle\nleq C_G(y) and ⟨y⟩≰CG(x)\langle y\rangle\nleq C_G(x), then PE⁡(G)\operatorname{PE}(G) has an induced cycle of even length ≥4\ge4.

Proof. Let X,Y\mathcal{X},\mathcal{Y} be the sets of GG-conjugates of ⟨x⟩,⟨y⟩\langle x\rangle,\langle y\rangle and choose one generator for each member; these are the vertices of BB. Two distinct members of X\mathcal{X} are non-adjacent because a cyclic group has at most one subgroup of order rar^a; likewise for Y\mathcal{Y}. A member of X\mathcal{X} and one of Y\mathcal{Y} are adjacent if and only if they commute (commuting elements of coprime orders generate a cyclic group). So BB is a bipartite induced subgraph of PE⁡(G)\operatorname{PE}(G). The vertex ⟨x⟩\langle x\rangle is adjacent to every ⟨y⟩c\langle y\rangle^c with c∈CG(x)c\in C_G(x), and there are ∣CG(x):NCG(x)(⟨y⟩)∣≥2|C_G(x):N_{C_G(x)}(\langle y\rangle)|\ge2 of these; by conjugation every vertex of X\mathcal{X} has degree ≥2\ge2, and symmetrically for Y\mathcal{Y}. A finite graph of minimum degree ≥2\ge2 has a cycle, a shortest cycle is induced, and in BB it has even length ≥4\ge4.

Lemma 2.6 (Quotient version). Let Z≤Z(G)Z\le Z(G) and G‾=G/Z\overline{G}=G/Z. Let x,y∈Gx,y\in G commute with x‾,y‾\overline{x},\overline{y} of coprime prime-power orders. If there are c∈CG(y)c\in C_G(y) and c′∈CG(x)c'\in C_G(x) with xc∉⟨x⟩Zx^c\notin\langle x\rangle Z and yc′∉⟨y⟩Zy^{c'}\notin\langle y\rangle Z, then PE⁡(G‾)\operatorname{PE}(\overline{G}) has an induced cycle of length ≥4\ge4.

Proof. c‾∈CG‾(y‾)\overline{c}\in C_{\overline{G}}(\overline{y}) and x‾c‾∉⟨x‾⟩\overline{x}^{\overline{c}}\notin\langle\overline{x}\rangle, so ⟨x‾⟩≰CG‾(y‾)\langle\overline{x}\rangle\nleq C_{\overline{G}}(\overline{y}); symmetrically for y‾\overline{y}. Apply Lemma 2.5.

Lemma 2.7 (Numerical criterion). Let x,yx,y commute and have prime orders r≠sr\ne s, and put g=gcd⁡(∣CG(x)∣,∣CG(y)∣)g=\gcd(|C_G(x)|,|C_G(y)|). If ∣CG(x)∣/g>s−1|C_G(x)|/g>s-1 and ∣CG(y)∣/g>r−1|C_G(y)|/g>r-1, then PE⁡(G)\operatorname{PE}(G) is not chordal.

Proof. If ⟨y⟩≤CG(x)\langle y\rangle\le C_G(x) then CG(x)/(CG(x)∩CG(y))C_G(x)/(C_G(x)\cap C_G(y)) embeds in Aut⁡(Cs)\operatorname{Aut}(C_s), so ∣CG(x):CG(x)∩CG(y)∣≤s−1|C_G(x):C_G(x)\cap C_G(y)|\le s-1. But ∣CG(x)∩CG(y)∣|C_G(x)\cap C_G(y)| divides gg, so this index is ≥∣CG(x)∣/g\ge|C_G(x)|/g, a contradiction. The same holds for ⟨x⟩\langle x\rangle. Apply Lemma 2.5.

Lemma 2.8 (Direct products). Suppose A×B≤GA\times B\le G, where AA has two distinct subgroups of prime order rr and BB has two distinct subgroups of prime order s≠rs\ne r. Then PE⁡(G)\operatorname{PE}(G) is not chordal. This applies when A,BA,B are non-abelian simple, with r∣∣A∣r\mid|A|, s∣∣B∣s\mid|B|, r≠sr\ne s (a subgroup of prime order in a simple group is not normal, hence has ≥2\ge2 conjugates), and to Alt⁡(4)×Alt⁡(5)\operatorname{Alt}(4)\times\operatorname{Alt}(5) and PSL⁡3(2)×S4\operatorname{PSL}_3(2)\times S_4.

Proof. Take a,a′∈Aa,a'\in A of order rr and b,b′∈Bb,b'\in B of order ss with ⟨a⟩≠⟨a′⟩\langle a\rangle\ne\langle a'\rangle, ⟨b⟩≠⟨b′⟩\langle b\rangle\ne\langle b'\rangle. Then a≁a′a\nsim a' and b≁b′b\nsim b', while every cross pair commutes and has coprime orders, hence is adjacent. So (a,b,a′,b′)(a,b,a',b') is an induced C4C_4.

The lifting theorem

Proof of Theorem 1.2. We prove the contrapositive: if PE⁡(G)\operatorname{PE}(G) contains an induced cycle of length ≥4\ge4 (resp. an induced P4P_4), so does P(G)P(G).

Let Γ\Gamma be an induced subgraph of PE⁡(G)\operatorname{PE}(G) that is a cycle v1,…,vkv_1,\ldots,v_k (k≥4k\ge4, indices mod kk) or a path v1,…,vkv_1,\ldots,v_k (k≥4k\ge4), with edges ei=vivi+1e_i=v_iv_{i+1}. Being induced and of length ≥4\ge4, Γ\Gamma has no triangle. Step 1. Let II be the set of ii such that eie_i is an edge of Γ\Gamma but vi̸∼Pvi+1v_i \not\sim_P v_{i+1}. For i∈Ii \in I let ziz_i generate the cyclic group ⟨vi,vi+1⟩\langle v_i,v_{i+1}\rangle; then vi,vi+1∈⟨zi⟩v_i,v_{i+1} \in\langle z_i\rangle.

Step 2 (key observation (K)). Let i∈Ii \in I and let ww be a vertex of Γ\Gamma. If w∈⟨zi⟩w \in\langle z_i\rangle or zi∈⟨w⟩z_i \in\langle w\rangle, then w∈{vi,vi+1}w \in\{v_i,v_{i+1}\}.

Indeed, if w∈⟨zi⟩w \in\langle z_i\rangle then ⟨w,vi⟩\langle w,v_i\rangle and ⟨w,vi+1⟩\langle w,v_{i+1}\rangle lie in the cyclic group ⟨zi⟩\langle z_i\rangle; if zi∈⟨w⟩z_i \in\langle w\rangle then vi,vi+1∈⟨w⟩v_i,v_{i+1} \in\langle w\rangle and both groups equal ⟨w⟩\langle w\rangle. In either case ww equals or is ∼E\sim_E-adjacent to each of vi,vi+1v_i,v_{i+1}. If w∉{vi,vi+1}w \notin\{v_i,v_{i+1}\} this is a triangle in Γ\Gamma, which is impossible.

Step 3 (consequences).

  • (a) zi∉V(Γ)z_i \notin V(\Gamma): if zi=vjz_i=v_j then vj∈⟨zi⟩v_j \in\langle z_i\rangle, so by (K) vj∈{vi,vi+1}v_j \in\{v_i,v_{i+1}\}; but zi∈{vi,vi+1}z_i \in\{v_i,v_{i+1}\} would give vi∼Pvi+1v_i \sim_P v_{i+1}, contradicting i∈Ii \in I.

  • (b) For i≠ji \ne j in II, zj∉⟨zi⟩z_j \notin\langle z_i\rangle (in particular zi≠zjz_i \ne z_j and zi̸∼Pzjz_i \not\sim_P z_j): if zj∈⟨zi⟩z_j \in\langle z_i\rangle then vj,vj+1∈⟨zj⟩≤⟨zi⟩v_j,v_{j+1} \in\langle z_j\rangle\le\langle z_i\rangle, so by (K) {vj,vj+1}={vi,vi+1}\{v_j,v_{j+1}\}=\{v_i,v_{i+1}\} and j=ij=i.

  • (c) For i∈Ii \in I and a vertex vjv_j of Γ\Gamma: zi∼Pvjz_i \sim_P v_j if and only if j∈{i,i+1}j \in\{i,i+1\}. The “if” holds as vj∈⟨zi⟩v_j \in\langle z_i\rangle; the “only if” is (K).

Step 4. Let Γ′\Gamma' arise from Γ\Gamma by replacing, for every i∈Ii \in I, the edge vivi+1v_iv_{i+1} by the path vi,zi,vi+1v_i,z_i,v_{i+1}. By (a),(b) its vertices are distinct, and it is a cycle (resp. path) of length ≥k≥4\ge k \ge4. We claim Γ′\Gamma' is an induced subgraph of P(G)P(G).

  • Its edges are ∼P\sim_P-edges: viziv_iz_i, zivi+1z_iv_{i+1} by (c); eie_i for i∉Ii \notin I by definition of II.

  • A pair vjvlv_jv_l that is not an edge of Γ′\Gamma' is non-adjacent in Γ\Gamma (hence in PE(G)P_E(G), hence in P(G)P(G)), or equals vivi+1v_iv_{i+1} with i∈Ii \in I (non-adjacent in P(G)P(G) by definition of II).

  • A pair zivjz_iv_j that is not an edge has j∉{i,i+1}j \notin\{i,i+1\} and is non-adjacent by (c).

  • zizjz_iz_j (i≠ji \ne j) is non-adjacent by (b).

Step 5. If Γ\Gamma is an induced cycle, Γ′\Gamma' is an induced cycle of length ≥4\ge4 in P(G)P(G). If Γ\Gamma is an induced P4P_4, Γ′\Gamma' is an induced path on ≥4\ge4 vertices of P(G)P(G) and any four consecutive vertices induce a P4P_4.

Simple groups with chordal PE(G)P_E(G)

The following facts are used; sources are listed in § 8.

Proposition 4.1 (PSL2(q)_2(q), q≥4q \ge4). PE(PSL⁡2(q))P_E(\operatorname{PSL}_2(q)) is chordal, and in fact PE(PSL⁡2(q))−{1}P_E(\operatorname{PSL}_2(q))-\{1\} is a disjoint union of cliques; in particular PE(PSL⁡2(q))P_E(\operatorname{PSL}_2(q)) is a cograph (cf. [3]).

Proof. Facts D (§ 8). Let AA be a Sylow pp-subgroup (q=pfq=p^f); C(a)=AC(a)=A for a∈A#a \in A^\#. qq even. All involutions lie in Sylow 2-subgroups, and the tori have odd orders q±1q \pm1. Every u≠1u \ne1 is a 2-element, in AA, or lies in a torus TT with C(u)=TC(u)=T. qq odd. For an involution zz, C(z)C(z) is dihedral of order q−εq-\varepsilon (q≡ε(mod4)q \equiv\varepsilon\pmod{4}), zz is its central involution and the rotation subgroup RR is cyclic of even order m=(q−ε)/2m=(q-\varepsilon)/2.

We show every u≠1u \ne1 lies in a unique maximal cyclic subgroup M(u)M(u):

  • u∈Au \in A: a cyclic subgroup containing uu lies in C(u)=AC(u)=A, so has order pp and M(u)=⟨u⟩M(u)=\langle u\rangle.

  • ∣u∣≥2|u| \ge2 and p∤∣u∣p \nmid|u|: a cyclic subgroup containing uu lies in C(u)=TC(u)=T, so M(u)=TM(u)=T.

  • u=zu=z an involution, qq odd: a cyclic subgroup containing zz lies in C(z)C(z). If m≥4m \ge4 a reflection is not central, so it lies in RR and M(z)=RM(z)=R. If m=2m=2 (q=5q=5) then C(z)≅V4C(z) \cong V_4 and M(z)=⟨z⟩M(z)=\langle z\rangle.

If ⟨u,h⟩\langle u,h\rangle is cyclic it lies in a maximal cyclic subgroup, which then equals M(u)M(u) and M(h)M(h); so u∼Eh⟺M(u)=M(h)u \sim_E h \Longleftrightarrow M(u)=M(h), and PE−{1}P_E-\{1\} is a disjoint union of cliques. Apply Lemma 2.2.

Proposition 4.2 (Sz(q)(q)). Let q=22n+1q=2^{2n+1} with n≥1n\geq1. Then PE(Sz⁡(q))P_E(\operatorname{Sz}(q)) is chordal.

Proof. Facts S. Let PP be a Sylow 2-subgroup, Z=Z(P)=Ω1(P)Z=Z(P)=\Omega_1(P).

Odd order. If ∣u∣|u| is odd, neighbours of uu lie in C(u)=TC(u)=T, a cyclic torus, so N[u]=TN[u]=T is a clique.

Involution z∈Zz\in Z (note C(z)=PC(z)=P for every involution z∈Zz\in Z, and all involutions lie in ZZ). A neighbour hh lies in PP. If ∣h∣=2|h|=2 and h≠zh\neq z then ⟨z,h⟩≅V4\langle z,h\rangle\cong V_4 is not cyclic. If ∣h∣=4|h|=4 then h2h^2 is the unique involution of ⟨z,h⟩\langle z,h\rangle, so h2=zh^2=z.

Element ww of order 4. A neighbour lies in C(w)=⟨w⟩ZC(w)=\langle w\rangle Z, so is h=wiz′h=w^i z' with z′∈Zz'\in Z and ⟨w,h⟩=⟨w,z′⟩\langle w,h\rangle=\langle w,z'\rangle; if z′∉⟨w2⟩z'\notin\langle w^2\rangle this contains V4V_4. So N[w]=⟨w⟩N[w]=\langle w\rangle.

Hence PE(Sz⁡(q))−{1}P_E(\operatorname{Sz}(q))-\{1\} is the disjoint union of the cliques given by the tori (minus 1) and the components {z}∪{h:h2=z}\{z\}\cup\{h:h^2=z\}, each a union of triangles {z,w,w−1}\{z,w,w^{-1}\} sharing the cut vertex zz. Every block is a clique, so there are no induced cycles of length ≥4\geq4; apply Lemma 2.2. (Note that PE(Sz⁡(q))P_E(\operatorname{Sz}(q)) itself contains diamonds {1,z,w,w′}\{1,z,w,w'\} with w2=w′2=zw^2={w'}^2=z, ⟨w⟩≠⟨w′⟩\langle w\rangle\neq\langle w'\rangle; the block statement refers to PE−{1}P_E-\{1\}.)

Proposition 4.3 (PSL3_3(4)). PE(PSL⁡3(4))P_E(\operatorname{PSL}_3(4)) is chordal.

Proof. The element orders of PSL⁡3(4)\operatorname{PSL}_3(4) are 1,2,3,4,5,71,2,3,4,5,7 (ATLAS), so it is EPPO; apply Lemma 2.3.

Proposition 4.4 (Alt(7)). PE(Alt⁡(7))P_E(\operatorname{Alt}(7)) is chordal.

Proof. The element orders are 1,…,71,\ldots,7 with 4, 5, 6, 7 occurring. A cyclic overgroup of an element of order 4, 5, 6 or 7 has order a multiple of it and at most 7, so equal to it; thus such elements lie in a unique maximal cyclic subgroup, are simplicial (Lemma 2.4), and may be removed first.

All involutions of Alt⁡(7)\operatorname{Alt}(7) are conjugate to z=(12)(34)z=(12)(34), and CAlt⁡(7)(z)=12∣CSym⁡(7)(z)∣=12∣D8×Sym⁡{5,6,7}∣=24C_{\operatorname{Alt}(7)}(z)=\frac{1}{2}|C_{\operatorname{Sym}(7)}(z)|=\frac{1}{2}|D_8\times\operatorname{Sym}\{5,6,7\}|=24 has Sylow 3-subgroup ⟨(567)⟩\langle(567)\rangle (a subgroup of order 3 of D8×Sym⁡{5,6,7}D_8\times\operatorname{Sym}\{5,6,7\} lies in Sym⁡{5,6,7}\operatorname{Sym}\{5,6,7\}, where it is unique). In the remaining graph N[z]={1,z,u,u2}N[z]=\{1,z,u,u^2\} with u=(567)u=(567), which is a clique (⟨zu⟩\langle zu\rangle is cyclic of order 6); so zz is simplicial and all involutions may be removed. What remains is {1}\{1\} together with the subgroups of order 3, triangles through 1; these eliminate in turn. By Lemma 2.4, PE(Alt⁡(7))P_E(\operatorname{Alt}(7)) is chordal.

Simple groups with non-chordal PE(G)P_E(G)

Alternating groups

Proposition 5.1. PE(Alt⁡(n))P_E(\operatorname{Alt}(n)) is non-chordal for n≥8n\geq8. Also PE(Sym⁡(n))P_E(\operatorname{Sym}(n)) is non-chordal for n≥6n\geq6 (only Sym⁡(6)≅Sp⁡4(2)\operatorname{Sym}(6)\cong\operatorname{Sp}_4(2) is used below, as an auxiliary group).

Proof. Sym⁡(6)\operatorname{Sym}(6): take x=(123)x=(123), y=(45)y=(45). Then C(x)=⟨x⟩×Sym⁡{4,5,6}C(x)=\langle x\rangle\times\operatorname{Sym}\{4,5,6\} contains (46)(46), which moves ⟨y⟩\langle y\rangle, and C(y)=⟨y⟩×Sym⁡{1,2,3,6}C(y)=\langle y\rangle\times\operatorname{Sym}\{1,2,3,6\} contains (16)(16) with x(16)=(623)∉⟨x⟩x^{(16)}=(623)\notin\langle x\rangle. Lemma 2.5.

Alt⁡(8)\operatorname{Alt}(8): take x=(123)x=(123), y=(45)(67)y=(45)(67). Then CAlt⁡(8)(x)=⟨x⟩×Alt⁡{4,…,8}C_{\operatorname{Alt}(8)}(x)=\langle x\rangle\times\operatorname{Alt}\{4,\ldots,8\} contains y∈Alt⁡(5)y\in\operatorname{Alt}(5) and ⟨y⟩\langle y\rangle is normal in the simple group Alt⁡(5)\operatorname{Alt}(5). Also c=(18)(45)∈Alt⁡(8)c=(18)(45)\in\operatorname{Alt}(8) commutes with yy and xc=(823)∉⟨x⟩x^c=(823)\notin\langle x\rangle. Lemma 2.5.

Larger nn: Lemma 2.1(a).

Linear groups

Let EijE_{ij} denote matrix units.

Lemma 5.2 (Central quotients of SL3(q)\mathrm{SL}_3(q)). Let q≠2,4q \ne2,4 and Z0≤Z(SL3(q))Z_0 \le Z(\mathrm{SL}_3(q)). Then PE(SL3(q)/Z0)\mathrm{PE}(\mathrm{SL}_3(q)/Z_0) is non-chordal. (In particular SL3(q)\mathrm{SL}_3(q) and PSL3(q)\mathrm{PSL}_3(q) are non-chordal.)

Proof. Put y=I+E12y=I+E_{12}, c=I+E13c=I+E_{13}, c′=I+E21c'=I+E_{21} and choose xx as follows.

  • qq odd: x=diag⁡(−1,−1,1)x=\operatorname{diag}(-1,-1,1), of order 22; x∉Z0x\notin Z_0 since ∣Z(SL3(q))∣|Z(\mathrm{SL}_3(q))| divides 33, so xˉ\bar{x} has order 22; ∣yˉ∣=p|\bar{y}|=p is odd.

  • q=2f≥8q=2^f\ge8: q−1≡7(mod8)q-1\equiv7\pmod{8} while 3k≡1,3(mod8)3^k\equiv1,3\pmod{8}, so q−1q-1 has a prime divisor r≠3r\ne3. Take a∈Fq×a\in\mathbb{F}_q^\times of order rr and x=diag⁡(a,a,a−2)x=\operatorname{diag}(a,a,a^{-2}). Then a3≠1a^3\ne1, so xx is not scalar, xˉ\bar{x} has order rr, and ∣yˉ∣=2|\bar{y}|=2.

Then xx commutes with yy and c′c' (its first two diagonal entries are equal), and c∈C(y)c\in C(y) because E12E13=E13E12=0E_{12}E_{13}=E_{13}E_{12}=0. Further cxc−1=x+(x33−x11)E13cxc^{-1}=x+(x_{33}-x_{11})E_{13} with x33≠x11x_{33}\ne x_{11} is not diagonal, so xc∉⟨x⟩Z0x^c\notin\langle x\rangle Z_0, a group of diagonal matrices. And yc′=I−E11+E22+E12−E21y^{c'}=I-E_{11}+E_{22}+E_{12}-E_{21} has non-zero (2,1)(2,1) entry, whereas every element of ⟨y⟩Z0\langle y\rangle Z_0 is a scalar multiple of I+kE12I+kE_{12}. Lemma 2.6 applies.

Proposition 5.3. PE(PSLn(q))\mathrm{PE}(\mathrm{PSL}_n(q)) is non-chordal for n=3n=3, q≠2,4q\ne2,4, and for all n≥4n\ge4 and all qq.

Proof. n=3n=3 is Lemma 5.2. Let n≥4n\ge4 and Z={λI:λn=1}Z=\{\lambda I:\lambda^n=1\}.

  • q≠2,4q\ne2,4: the block H=SL3(q)⊕In−3H=\mathrm{SL}_3(q)\oplus I_{n-3} meets ZZ trivially (a scalar in HH is 11 on the identity block); Lemmas 5.2 (with Z0=1Z_0=1) and 2.1(b).

  • q=4q=4: H=(SL2(4)×SL2(4))⊕In−4≅Alt⁡(5)×Alt⁡(5)H=(\mathrm{SL}_2(4)\times\mathrm{SL}_2(4))\oplus I_{n-4}\cong\operatorname{Alt}(5)\times\operatorname{Alt}(5) meets ZZ trivially (a scalar λ\lambda in a block SL2(4)\mathrm{SL}_2(4) has λ2=1\lambda^2=1, so λ=1\lambda=1); Lemmas 2.8, 2.1(b).

  • q=2q=2: PSLn(2)=SLn(2)⊇SL4(2)≅Alt⁡(8)\mathrm{PSL}_n(2)=\mathrm{SL}_n(2)\supseteq\mathrm{SL}_4(2)\cong\operatorname{Alt}(8); Prop. 5.1.

Symplectic groups

Let e1,f1,e2,f2e_1,f_1,e_2,f_2 be a symplectic basis with B(ei,fi)=1=−B(fi,ei)B(e_i,f_i)=1=-B(f_i,e_i), and Tu:v↦v+B(v,u)uT_u:v\mapsto v+B(v,u)u a symplectic transvection; then gTug−1=TgugT_ug^{-1}=T_{gu} and T−u=TuT_{-u}=T_u.

Proposition 5.4. For qq odd, Sp4(q)\mathrm{Sp}_4(q) and PSp4(q)\mathrm{PSp}_4(q) are non-chordal; for qq even, q≥4q\ge4, Sp4(q)=PSp4(q)\mathrm{Sp}_4(q)=\mathrm{PSp}_4(q) is non-chordal; Sp4(2)≅Sym⁡(6)\mathrm{Sp}_4(2)\cong\operatorname{Sym}(6) is non-chordal. (For q=2q=2 the simple group is Sp4(2)′≅Alt⁡(6)≅PSL2(9)\mathrm{Sp}_4(2)'\cong\operatorname{Alt}(6)\cong\mathrm{PSL}_2(9), which is chordal.)

Proof. q=2q=2: Prop. 5.1.

qq odd. Let x=−1x=-1 on W1=⟨e1,f1⟩W_1=\langle e_1,f_1\rangle and +1+1 on W2=⟨e2,f2⟩W_2=\langle e_2,f_2\rangle; y=Te1y=T_{e_1}, c=Te1+e2c=T_{e_1+e_2}, c′=Tf1c'=T_{f_1}, Z={±1}Z=\{\pm1\}. Since xTux−1=TxuxT_ux^{-1}=T_{xu} and T−u=TuT_{-u}=T_u we get [x,y]=[x,c′]=1[x,y]=[x,c']=1; ce1=e1ce_1=e_1 as B(e1,e1+e2)=0B(e_1,e_1+e_2)=0, so c∈C(y)c\in C(y). Further cf1=f1+B(f1,e1+e2)(e1+e2)=f1−(e1+e2)∉W1∪W2cf_1=f_1+B(f_1,e_1+e_2)(e_1+e_2)=f_1-(e_1+e_2)\notin W_1\cup W_2, so the (−1)(-1)-eigenspace c(W1)c(W_1) of xcx^c is neither W1W_1, W2W_2 nor 0,V0,V; hence xc∉{±1,±x}x^c\notin\{\pm1,\pm x\}. Finally c′e1=e1+B(e1,f1)f1=e1+f1c'e_1=e_1+B(e_1,f_1)f_1=e_1+f_1, so yc′=Te1+f1y^{c'}=T_{e_1+f_1} is a non-trivial unipotent element with image line ⟨e1+f1⟩≠⟨e1⟩\langle e_1+f_1\rangle\ne\langle e_1\rangle, while the unipotent elements of ⟨y⟩Z\langle y\rangle Z are 11 or have image line ⟨e1⟩\langle e_1\rangle. So yc′∉⟨y⟩Zy^{c'}\notin\langle y\rangle Z. The elements x,yx,y have orders 2,p2,p. By Lemma 2.6 with ZZ, PSp4(q)\mathrm{PSp}_4(q) is non-chordal. The same computation shows xc∉{1,x}x^c\notin\{1,x\} and yc′∉⟨y⟩y^{c'}\notin\langle y\rangle, so Lemma 2.6 with Z=1Z=1 shows that Sp4(q)\mathrm{Sp}_4(q) itself is non-chordal.

qq even, q≥4q\ge4. Sp4(q)⊇SL2(q)×SL2(q)\mathrm{Sp}_4(q)\supseteq\mathrm{SL}_2(q)\times\mathrm{SL}_2(q) with simple factors, and the centre is trivial. Lemma 2.8 with r=2r=2 and an odd prime s∣q+1s\mid q+1.

Proposition 5.5. PE(PSp2m(q))\mathrm{PE}(\mathrm{PSp}_{2m}(q)) is non-chordal for all m≥3m\ge3 and all qq.

Proof. H=Sp4(q)⊕I2m−4H=\mathrm{Sp}_4(q)\oplus I_{2m-4} meets the centre {±1}\{\pm1\} trivially (as −1-1 is non-trivial on the identity block, of dimension 2m−4≥22m-4\ge2). By Prop. 5.4, H≅Sp4(q)H\cong\mathrm{Sp}_4(q) is non-chordal for every qq (including q=2q=2, where Sp4(2)≅Sym⁡(6)\mathrm{Sp}_4(2)\cong\operatorname{Sym}(6)); apply Lemma 2.1(b).

Unitary groups

We use the Hermitian form with Gram matrix J=antidiag⁡(1,1,1)J=\operatorname{antidiag}(1,1,1) on Fq23\mathbb{F}_{q^2}^3; bars denote λ↦λq\lambda\mapsto\lambda^q. The direct computation of gˉTJg=J\bar{g}^{T}Jg=J gives:

  • (1αβ01−αˉ001)∈SU⁡3(q)\begin{pmatrix} 1 & \alpha& \beta\\ 0 & 1 & -\bar{\alpha} \\ 0 & 0 & 1 \end{pmatrix} \in\operatorname{SU}_3(q) if and only if β+βˉ+ααˉ=0\beta+\bar{\beta}+\alpha\bar{\alpha}=0; these form a group UU of order q3q^3 with centre {I+tE13:t+tˉ=0}\{I+tE_{13}:t+\bar{t}=0\};

  • I+sE31∈SU⁡3(q)I+sE_{31}\in\operatorname{SU}_3(q) if and only if s+sˉ=0s+\bar{s}=0;

  • diag⁡(a,b,a′)∈SU⁡3(q)\operatorname{diag}(a,b,a')\in\operatorname{SU}_3(q) if and only if bbˉ=1b\bar{b}=1, a′=aˉ−1a'=\bar{a}^{-1} and aba′=1aba'=1.

Proposition 5.6. PE(SU⁡3(q))P_E(\operatorname{SU}_3(q)) and PE(PSU⁡3(q))P_E(\operatorname{PSU}_3(q)) are non-chordal for q≥3q\geq3.

Proof. Let Z=Z(SU⁡3(q))Z=Z(\operatorname{SU}_3(q)), of order gcd⁡(3,q+1)\gcd(3,q+1); the case Z=1Z=1 gives SU⁡3(q)\operatorname{SU}_3(q). Choose a∈Fq2×a\in\mathbb{F}_{q^2}^{\times} with aq+1=1a^{q+1}=1, a3≠1a^3\ne1 and of prime-power order:

  • qq odd: a=−1a=-1;

  • qq even, q+1q+1 has a prime divisor r≠3r\ne3: aa of order rr;

  • qq even, q+1=3kq+1=3^k: by Mihăilescu’s theorem q=8q=8; take aa of order 99 (then x3=a3I∈Zx^3=a^3I\in Z and xˉ\bar{x} has order 33).

In every case a≠a−2a\ne a^{-2} (as a3≠1a^3\ne1), so x=diag⁡(a,a−2,a)∈SU⁡3(q)x=\operatorname{diag}(a,a^{-2},a)\in\operatorname{SU}_3(q) is not scalar and xˉ≠1\bar{x}\ne1. Put y=I+tE13y=I+tE_{13} with t≠0t\ne0, t+tˉ=0t+\bar{t}=0; ∣y∣=p|y|=p is coprime to ∣xˉ∣|\bar{x}| (for qq odd ∣x∣=2|x|=2; for qq even ∣y∣=2|y|=2 and ∣xˉ∣|\bar{x}| is odd). Clearly [x,y]=1[x,y]=1.

Take c∈Uc\in U with α≠0\alpha\ne0 (exists since the trace Fq2→Fq\mathbb{F}_{q^2}\to\mathbb{F}_q is onto). As E13E_{13} is central in UU, c∈C(y)c\in C(y). The (1,2)(1,2) entry of cxc−1−xcxc^{-1}-x is α(a−2−a)≠0\alpha(a^{-2}-a)\ne0, so xcxc is not diagonal and xc∉⟨x⟩Zx^c\notin\langle x\rangle Z.

Take c′=I+sE31c'=I+sE_{31} with s≠0s\ne0, s+sˉ=0s+\bar{s}=0; it commutes with xx since x11=x33x_{11}=x_{33}, and

yc′=I+t(E13−sE11+sE33−s2E31)y^{c'}=I+t(E_{13}-sE_{11}+sE_{33}-s^2E_{31})

has (3,1)(3,1) entry −ts2≠0-ts^2\ne0, while every element of ⟨y⟩Z\langle y\rangle Z has (3,1)(3,1) entry 0. Apply Lemma 2.6.

Proposition 5.7. PE(PSU⁡n(q))P_E(\operatorname{PSU}_n(q)) is non-chordal for all n≥4n\geq4 and all qq.

Proof. q≥3q\geq3: the block SU⁡3(q)⊕In−3\operatorname{SU}_3(q)\oplus I_{n-3} meets the centre (scalars) trivially; Prop. 5.6, Lemma 2.1(b). q=2q=2, n=4n=4: Z(SU⁡4(2))=1Z(\operatorname{SU}_4(2))=1 and PSU⁡4(2)≅PSp⁡4(3)\operatorname{PSU}_4(2)\cong\operatorname{PSp}_4(3), non-chordal by Prop. 5.4. q=2q=2, n≥5n\geq5: block SU⁡4(2)⊕In−4\operatorname{SU}_4(2)\oplus I_{n-4}.

Orthogonal groups

Let OO be the full isometry group of the quadratic form, and Ω≤O\Omega\leq O the usual subgroup: for n≥5n\geq5 the derived subgroup of OO; equivalently the kernel of the spinor norm and determinant (qq odd), resp. of the Dickson invariant (qq even). In all cases O/ΩO/\Omega is abelian (of order ≤4\leq4), so Ω\Omega contains every perfect subgroup of OO.

Proposition 5.8. Let GG be Ω2n+1(q)\Omega_{2n+1}(q) (n≥3n\geq3), PΩ2n+(q)P\Omega^+_{2n}(q) (n≥4n\geq4) or PΩ2n−(q)P\Omega^-_{2n}(q) (n≥4n\geq4). Then PE(G)P_E(G) is non-chordal. (Orthogonal groups of lower rank are isomorphic to PSL⁡2(q)\operatorname{PSL}_2(q), PSL⁡2(q2)\operatorname{PSL}_2(q^2), PSp⁡4(q)\operatorname{PSp}_4(q), PSL⁡4(q)\operatorname{PSL}_4(q), PSU⁡4(q)\operatorname{PSU}_4(q) and are covered elsewhere.)

Proof. q≠2,4q\ne2,4. Write the space as U⊕U∗⊕WU\oplus U^*\oplus W with UU totally singular of dimension k≥3k\geq3 (k=nk=n, dim⁡W=1\dim W=1 for Ω2n+1\Omega_{2n+1}; k=nk=n, W=0W=0 for the ++ type; k=n−1k=n-1, WW an anisotropic 22-space, for the −- type). The map g↦g⊕g−Tg\mapsto g\oplus g^{-T} embeds SL⁡3(q)≤SL⁡k(q)\operatorname{SL}_3(q)\leq\operatorname{SL}_k(q) (acting on the first three coordinates of UU) into OO; the image H≅SL⁡3(q)H\cong\operatorname{SL}_3(q) is perfect, so H≤ΩH\leq\Omega. HH acts trivially on a non-zero subspace, so HH meets the centre of Ω\Omega (⊆{±1}\subseteq\{\pm1\}) trivially. By Lemma 5.2 with Z0=1Z_0=1 and Lemma 2.1(b), GG is non-chordal. (For qq odd and type 2n+12n+1 the centre is trivial.)

q∈{2,4}q \in\{2,4\}. For Ω2n+1(q)≅Sp⁡2n(q)\Omega_{2n+1}(q) \cong\operatorname{Sp}_{2n}(q) use Prop. 5.5. For Ω2n±(q)\Omega^\pm_{2n}(q), the stabilizer in O2n±(q)O^\pm_{2n}(q) of a non-singular vector vv is Sp⁡2n−2(q)×⟨rv⟩\operatorname{Sp}_{2n-2}(q) \times\langle r_v\rangle (rvr_v the transvection with centre vv, which fixes vv as qq is even). The factor Sp⁡2n−2(q)\operatorname{Sp}_{2n-2}(q) is perfect since 2n−2≥62n-2 \ge6, so it lies in Ω\Omega; it is non-chordal by Prop. 5.5. The centre is trivial for qq even. □

Exceptional groups and the Tits group

Proposition 5.9. PE(G)P_E(G) is non-chordal for G=2G2(q)G = {}^2G_2(q) (q=32n+1≥27q = 3^{2n+1} \ge27), G2(q)G_2(q) (q≥3q \ge3), G2(2)′≅PSU⁡3(3)G_2(2)' \cong\operatorname{PSU}_3(3), 3D4(q){}^3D_4(q), F4(q)F_4(q), 2F4(q){}^2F_4(q) (q=22n+1≥8q = 2^{2n+1} \ge8), the Tits group 2F4(2)′{}^2F_4(2)', E6(q)E_6(q), 2E6(q){}^2E_6(q), E7(q)E_7(q), E8(q)E_8(q).

Proof. 2G2(q){}^2G_2(q), q≥27q \ge27. By Facts W, an involution xx has ∣C(x)∣=q(q2−1)|C(x)| = q(q^2-1) with C(x)≅C2×PSL⁡2(q)C(x) \cong C_2 \times\operatorname{PSL}_2(q); C(x)C(x) contains an element yy of order 3 (as 3∣q3 \mid q), and ∣C(y)∣∈{q2,2q2}|C(y)| \in\{q^2,2q^2\}. Then g=gcd⁡(∣C(x)∣,∣C(y)∣)∈{q,2q}g = \gcd(|C(x)|,|C(y)|) \in\{q,2q\}, so ∣C(x)∣/g≥(q2−1)/2>2|C(x)|/g \ge(q^2-1)/2 > 2 and ∣C(y)∣/g≥q>1|C(y)|/g \ge q > 1. Lemma 2.7.

Containments (sources in Table 1): G2(q)⊇SU⁡3(q)G_2(q) \supseteq\operatorname{SU}_3(q) for q≥3q \ge3, and G2(2)′≅PSU⁡3(3)G_2(2)' \cong\operatorname{PSU}_3(3) (ATLAS); 3D4(q)⊇G2(q){}^3D_4(q) \supseteq G_2(q); the Tits group contains L3(3):2⊇SL⁡3(3)=PSL⁡3(3)L_3(3):2 \supseteq\operatorname{SL}_3(3) = \operatorname{PSL}_3(3) (non-chordal by Lemma 5.2 as 3≠2,43 \ne2,4) and 2F4(q)⊇2F4(2)′{}^2F_4(q) \supseteq{}^2F_4(2)' (subfield subgroup); F4(q)F_4(q) contains the subgroup generated by long-root subgroups of a subsystem of type A2A_2, which is SL⁡3(q)/Z0\operatorname{SL}_3(q)/Z_0 for some Z0≤Z(SL⁡3(q))Z_0 \le Z(\operatorname{SL}_3(q)), non-chordal for q≠2,4q \ne2,4 by Lemma 5.2, whichever Z0Z_0 occurs; for qq even F4(q)⊇B4(q)≅Sp⁡8(q)F_4(q) \supseteq B_4(q) \cong\operatorname{Sp}_8(q), non-chordal by Prop. 5.5, which covers q=2,4q=2,4. For G∈{E6(q),2E6(q),E7(q),E8(q)}G \in\{E_6(q),{}^2E_6(q),E_7(q),E_8(q)\} (simple versions), let G~\widetilde{G} be the corresponding simply connected group; it contains a subgroup H≅F4(q)H \cong F_4(q) [2] (Dynkin sub-diagram of type F4F_4 for EkE_k, via E6≤E7≤E8E_6 \le E_7 \le E_8, and, for 2E6{}^2E_6, as the fixed points of the graph automorphism) and G=G~/NG = \widetilde{G}/N with NN central. Since F4(q)F_4(q) is simple non-abelian, H∩N=1H \cap N = 1, so HH embeds in GG (Lemma 2.1(b)); HH is non-chordal by the F4F_4 case. In all cases Lemma 2.1(a) transfers non-chordality to GG. □

Sporadic groups

Proposition 5.10. PE(G)P_E(G) is non-chordal for every sporadic simple group GG.

Proof. Centralizer orders and class data below are checked with the GAP Character Table Library (§ 7).

  • M11M_{11}: a class 6A6A with x=g3∈2Ax=g^3 \in2A, y=g2∈3Ay=g^2 \in3A, ∣C(x)∣=48|C(x)|=48, ∣C(y)∣=18|C(y)|=18, gcd⁡=6\gcd=6; 48/6=8>248/6=8>2, 18/6=3>118/6=3>1. Lemma 2.7.

  • M22M_{22}: ∣C(2A)∣=384|C(2A)|=384, ∣C(3A)∣=36|C(3A)|=36, gcd⁡=12\gcd=12; 32>232>2, 3>13>1. Lemma 2.7.

  • J3J_3: the only class of elements of order 6 is 6A6A, with g3∈2Ag^3 \in2A, g2∈3Ag^2 \in3A, ∣C(2A)∣=1920|C(2A)|=1920, ∣C(3A)∣=1080|C(3A)|=1080, gcd⁡=120\gcd=120; 16>216>2, 9>19>1. Lemma 2.7.

@-end- төхөөр

  • J1J_1: here ∣C(2A)∣=120|C(2A)| = 120, ∣C(3A)∣=30|C(3A)| = 30 and gcd⁡=30\gcd= 30, so ∣C(y)∣/gcd⁡=1≠1|C(y)|/\gcd= 1 \ne1 and Lemma 2.7 fails; we use Lemma 2.5 instead. C(2A)=2×Alt⁡(5)C(2A) = 2 \times\operatorname{Alt}(5) and C(3A)=3×D10C(3A) = 3 \times D_{10}. Take y∈3Ay \in3A and an involution x∈C(y)x \in C(y) (which lies in D10D_{10} and is non-central there), so ⟨x⟩⊈C(y)\langle x\rangle\nsubseteq C(y); and y∈C(x)=2×Alt⁡(5)y \in C(x) = 2 \times\operatorname{Alt}(5) lies in the simple factor, so ⟨y⟩⊈C(x)\langle y\rangle\nsubseteq C(x).

  • J2⊇Alt⁡(4)×Alt⁡(5)J_2 \supseteq\operatorname{Alt}(4) \times\operatorname{Alt}(5) and He⊇S4×PSL⁡3(2)He \supseteq S_4 \times\operatorname{PSL}_3(2) (maximal subgroups): Lemma 2.8.

  • Ru⊃2F4(2)′.2⊃2F4(2)′Ru \supset{}^2F_4(2)'.2 \supset{}^2F_4(2)' and Th⊃PSL⁡3(3)Th \supset\operatorname{PSL}_3(3) (maximal subgroups): Prop. 5.9, Lemma 2.1(a).

  • Each of the remaining 19 groups (including M11M_{11} itself) contains M11M_{11}; see Table 2.

Group GGContainment chain
M11M_{11}itself
M12M_{12}, M23M_{23}, HSHS, McLMcL, O′NO'N, BBM11≤GM_{11} \leq G (library class fusion)
M24M_{24}M11≤M23≤M24M_{11} \leq M_{23} \leq M_{24}
Co2Co_2, Co3Co_3M11≤M23≤GM_{11} \leq M_{23} \leq G
Co1Co_1M11≤M23≤Co2≤Co1M_{11} \leq M_{23} \leq Co_2 \leq Co_1
SuzSuz, HNHNM11≤M12≤M12.2≤GM_{11} \leq M_{12} \leq M_{12}.2 \leq G
Fi22Fi_{22}M11≤M12≤Fi22M_{11} \leq M_{12} \leq Fi_{22}
Fi23Fi_{23}M11≤Fi22M_{11} \leq Fi_{22} lifts to 2.Fi22≤Fi232.Fi_{22} \leq Fi_{23}
Fi24′Fi'_{24}M11≤Fi23≤Fi24′M_{11} \leq Fi_{23} \leq Fi'_{24}
LyLyM11≤McLM_{11} \leq McL lifts to 3.McL:2≤Ly3.McL:2 \leq Ly
MMM11≤BM_{11} \leq B lifts to 2.B≤M2.B \leq M
J4J_4M11≤M24≤211 ⁣: ⁣M24≤J4M_{11} \leq M_{24} \leq2^{11}\!:\!M_{24} \leq J_4

Table 2. Groups containing M11M_{11}. Lifting through a central extension uses that M11M_{11} is perfect with trivial Schur multiplier, so every central extension of M11M_{11} splits. Direct fusions are confirmed in the GAP Character Table Library; the remaining steps are ATLAS maximal subgroups.

Proof of Theorem 1.1

By the classification of finite simple groups, GG is cyclic of prime order, alternating, of Lie type, or sporadic. Table 3 accounts for every family exactly once, including the isomorphisms with small cases and the non-simple small groups that must be excluded.

FamilyPEP_E chordal?Reference / remark
CpC_pyescomplete graph
Alt⁡(5),Alt⁡(6)\operatorname{Alt}(5), \operatorname{Alt}(6)yes≅PSL⁡2(4)=PSL⁡2(5)\cong\operatorname{PSL}_2(4)=\operatorname{PSL}_2(5), PSL⁡2(9)≅Sp⁡4(2)′\operatorname{PSL}_2(9)\cong\operatorname{Sp}_4(2)'
Alt⁡(7)\operatorname{Alt}(7)yesProp. 4.4
Alt⁡(n), n≥8\operatorname{Alt}(n),\ n\geq8noProp. 5.1; Alt⁡(8)≅PSL⁡4(2)\operatorname{Alt}(8)\cong\operatorname{PSL}_4(2)
PSL⁡2(q), q≥4\operatorname{PSL}_2(q),\ q\geq4yesProp. 4.1; PSL⁡2(7)≅PSL⁡3(2)\operatorname{PSL}_2(7)\cong\operatorname{PSL}_3(2), PSL⁡2(8)≅2G2(3)′\operatorname{PSL}_2(8)\cong{}^2G_2(3)'; (PSL⁡2(2),PSL⁡2(3)\operatorname{PSL}_2(2),\operatorname{PSL}_2(3) not simple)
PSL⁡3(2)\operatorname{PSL}_3(2)yes≅PSL⁡2(7)\cong\operatorname{PSL}_2(7)
PSL⁡3(4)\operatorname{PSL}_3(4)yesProp. 4.3
PSL⁡3(q), q≠2,4\operatorname{PSL}_3(q),\ q\neq2,4noLemma 5.2
PSL⁡n(q), n≥4\operatorname{PSL}_n(q),\ n\geq4noProp. 5.3
PSU⁡3(q), q≥3\operatorname{PSU}_3(q),\ q\geq3noProp. 5.6; PSU⁡3(3)≅G2(2)′\operatorname{PSU}_3(3)\cong G_2(2)'; (PSU⁡3(2)\operatorname{PSU}_3(2) not simple)
PSU⁡n(q), n≥4\operatorname{PSU}_n(q),\ n\geq4noProp. 5.7; PSU⁡4(q)≅PΩ⁡6−(q)\operatorname{PSU}_4(q)\cong\operatorname{P\Omega}_6^-(q)
PSp⁡4(q), q≥3\operatorname{PSp}_4(q),\ q\geq3noProp. 5.4; Ω5(q)≅PSp⁡4(q)\Omega_5(q)\cong\operatorname{PSp}_4(q)
PSp⁡4(2)′≅Alt⁡(6)\operatorname{PSp}_4(2)'\cong\operatorname{Alt}(6)yescounted under PSL⁡2(9)\operatorname{PSL}_2(9)
PSp⁡2m(q), m≥3\operatorname{PSp}_{2m}(q),\ m\geq3noProp. 5.5
Ω2n+1(q) (n≥3), PΩ⁡2n±(q) (n≥4)\Omega_{2n+1}(q)\ (n\geq3),\ \operatorname{P\Omega}_{2n}^{\pm}(q)\ (n\geq4)noProp. 5.8
PΩ⁡3(q), PΩ⁡4−(q)\operatorname{P\Omega}_3(q),\ \operatorname{P\Omega}_4^-(q)yes≅PSL⁡2(q),PSL⁡2(q2)\cong\operatorname{PSL}_2(q),\operatorname{PSL}_2(q^2)
PΩ⁡6+(q)\operatorname{P\Omega}_6^+(q)no≅PSL⁡4(q)\cong\operatorname{PSL}_4(q)
Sz⁡(q), q≥8\operatorname{Sz}(q),\ q\geq8yesProp. 4.2; (Sz⁡(2)\operatorname{Sz}(2) not simple)
2G2(q), q≥27{}^2G_2(q),\ q\geq27noProp. 5.9; 2G2(3)′≅PSL⁡2(8){}^2G_2(3)'\cong\operatorname{PSL}_2(8)
G2(q), 3D4, F4, 2F4(q), 2F4(2)′, E6, 2E6, E7, E8G_2(q),\ {}^3D_4,\ F_4,\ {}^2F_4(q),\ {}^2F_4(2)',\ E_6,\ {}^2E_6,\ E_7,\ E_8noProp. 5.9; G2(2)′≅PSU⁡3(3)G_2(2)'\cong\operatorname{PSU}_3(3)
26 sporadic groupsnoProp. 5.10

Table 3. Every finite simple group is listed exactly once up to the displayed isomorphisms.

The groups with chordal PEP_E are therefore exactly CpC_p, Alt⁡(7)\operatorname{Alt}(7), PSL⁡2(q)\operatorname{PSL}_2(q) (q≥4q \geq4), Sz⁡(q)\operatorname{Sz}(q) (q≥8q \geq8) and PSL⁡3(4)\operatorname{PSL}_3(4).

Remark 6.1. Comparison with [2]: P(G)P(G) is chordal for simple GG if and only if GG is CpC_p, Alt⁡(5)\operatorname{Alt}(5), Alt⁡(6)\operatorname{Alt}(6), Alt⁡(7)\operatorname{Alt}(7), PSL⁡3(4)\operatorname{PSL}_3(4), or PSL⁡2(q)\operatorname{PSL}_2(q), Sz⁡(q)\operatorname{Sz}(q) subject to arithmetic conditions: (q∓1)/gcd⁡(q∓1,2)(q \mp1)/\gcd(q \mp1,2) for PSL⁡2(q)\operatorname{PSL}_2(q), resp. q−1q - 1 and q±2n+1+1q \pm2^{n+1} + 1 for Sz⁡(q)\operatorname{Sz}(q), each have at most two prime divisors and at most one prime divisor of multiplicity >1> 1. By Theorem 1.2 that list is contained in ours; the arithmetic conditions disappear for PEP_E because in PSL⁡2(q)\operatorname{PSL}_2(q) distinct maximal cyclic subgroups intersect trivially (Prop. 4.1) and in Sz⁡(q)\operatorname{Sz}(q) they intersect in at most an involution.

Computational verification

All checks are performed with GAP 4.12 (see [9]) (with the CTblLib package) and Python/NetworkX. Chordality of PE(G)P_E(G) is tested by listing all cyclic subgroups of GG (so that PE(G)P_E(G) is the union of the cliques they span).

  • PE(G)P_E(G) is chordal for G=PSL⁡2(q)G = \operatorname{PSL}_2(q) with q∈{4,5,7,8,9,11,13,16,17,19,23,25,27,29,31}q \in\{4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 23, 25, 27, 29, 31\}, G=Alt⁡(6)G = \operatorname{Alt}(6), Alt⁡(7)\operatorname{Alt}(7) and PSL⁡3(4)\operatorname{PSL}_3(4) (order 20160).

  • PE(G)P_E(G) is non-chordal for G=PSL⁡3(3)G=\operatorname{PSL}_3(3), PSU⁡3(3)\operatorname{PSU}_3(3), Alt⁡(8)\operatorname{Alt}(8) and M11M_{11} (same method), in agreement with the proofs above.

  • The ATLAS data used in Proposition 5.10 (classes, centralizer orders, class 6A and its powers for M11,M22,J1,J3M_{11},M_{22},J_1,J_3) are read from the GAP Character Table Library; the class fusions for the containments in Table 2 and in the proofs for Ru,Th,J2Ru,Th,J_2 and the Tits group are confirmed there, and the maximal subgroups S4×PSL⁡3(2)≤HeS_4\times\operatorname{PSL}_3(2)\leq He and L3(3)≤ThL_3(3)\leq Th are confirmed from the library’s list of maximal subgroups.

  • Chordality for Sz⁡(8)\operatorname{Sz}(8), PSp⁡4(3)\operatorname{PSp}_4(3), PSU⁡3(4)\operatorname{PSU}_3(4) and the larger PSL⁡2(q)\operatorname{PSL}_2(q); the containments in Table 1 and 211 ⁣: ⁣M24≤J42^{11}\!:\!M_{24}\leq J_4, taken from the cited literature and ATLAS.

ContainmentSource
SU3(q)≤G2(q)SU_3(q) \le G_2(q) (q≥3q \ge3), PSU3(3)≅G2(2)′PSU_3(3) \cong G_2(2)'Kleidman (odd qq), Cooperstein (qq even), ATLAS
G2(q)≤3D4(q)G_2(q) \le{}^3D_4(q)Kleidman (Steinberg triality groups)
L3(3):2≤2F4(2)′L_3(3):2 \le{}^2F_4(2)'ATLAS; Wilson §4.9
2F4(2)≤2F4(q){}^2F_4(2) \le{}^2F_4(q), q=22n+1q = 2^{2n+1}Malle (subfield subgroups)
A2(q)≤F4(q)A_2(q) \le F_4(q)Gorenstein–Lyons–Solomon, Prop. 2.6.2; Brachter–Kaja, Lemma 2.3
B4(q)≅Sp8(q)≤F4(q)B_4(q) \cong Sp_8(q) \le F_4(q), qq evenWilson §4.9
F4(q)≤E6(q),2E6(q),E7(q),E8(q)F_4(q) \le E_6(q),{}^2E_6(q),E_7(q),E_8(q)Brachter–Kaja [2], Lemma 2.3 (Dynkin sub-diagrams)

Table 1. Subgroup containments used in Proposition 5.9; full references in § 8.

Standard facts used

  • Facts D (Dickson). For G=PSL⁡2(q)G=\operatorname{PSL}_2(q): a Sylow pp-subgroup is elementary abelian of order qq and self-centralizing on its non-identity elements; every p′p'-element lies in a cyclic torus of order (q±1)/gcd⁡(2,q−1)(q\pm1)/\gcd(2,q-1) which is the centralizer of each of its elements of order >2>2; for qq odd the centralizer of an involution is dihedral of order q−εq-\varepsilon, q≡ε(mod4)q\equiv\varepsilon\pmod4. Sources: Dickson [6]; Huppert [10 Kap. II, §8] (Hauptsatz 8.27); Wilson [21 §3.3].

  • Facts S (Suzuki). For G=Sz⁡(q)G=\operatorname{Sz}(q), q=22n+1≥8q=2^{2n+1}\geq8: a Sylow 22-subgroup PP has order q2q^2, Z(P)=Ω1(P)Z(P)=\Omega_1(P) is elementary abelian of order qq and contains every involution, all elements of P∖Z(P)P\setminus Z(P) have order 44 with square in Z(P)Z(P); C(z)=PC(z)=P for each involution zz and C(w)=⟨w⟩Z(P)C(w)=\langle w\rangle Z(P) for ∣w∣=4|w|=4; elements of odd order have cyclic centralizers (the

orders q−1q - 1, q±2q+1q \pm\sqrt{2q + 1}), which intersect pairwise trivially. Sources: Suzuki [18, 19]; Huppert–Blackburn [11 Chap. XI, §3]; Wilson [21 §4.2].

  • Facts W (Ward). In 2G2(q){}^{2}G_{2}(q), q=32n+1≥27q = 3^{2n+1} \ge27: ∣C(x)∣=q(q2−1)|C(x)| = q(q^{2} - 1) and C(x)≅C2×PSL⁡2(q)C(x) \cong C_{2} \times\operatorname{PSL}_{2}(q) for an involution xx; elements of order 33 have centralizers of order q3q^{3} or 2q22q^{2} (when they commute with an involution). Sources: Ward [20]; Kleidman [12].

  • ATLAS [5]: element orders of PSL⁡3(4)\operatorname{PSL}_{3}(4) and Alt⁡(7)\operatorname{Alt}(7); isomorphisms SL⁡4(2)≅Alt⁡(8)\operatorname{SL}_{4}(2) \cong\operatorname{Alt}(8), Sp⁡4(2)≅Sym⁡(6)\operatorname{Sp}_{4}(2) \cong\operatorname{Sym}(6), PSU⁡4(2)≅PSp⁡4(3)\operatorname{PSU}_{4}(2) \cong\operatorname{PSp}_{4}(3), G2(2)′≅PSU⁡3(3)G_{2}(2)' \cong\operatorname{PSU}_{3}(3), and the low-rank orthogonal isomorphisms (Wilson [21 §3.11]); maximal subgroup containments for sporadic groups; Mihăilescu’s theorem: 2f+1=3k2^{f} + 1 = 3^{k} only for f∈{1,3}f \in\{1, 3\}.

Acknowledgments

The research of Pallabi Manna is supported by Anusandhan National Research Foundation (ANRF)-India under the National Postdoctoral Fellowship scheme (File No. PDF/2025/006751). The author would like to express sincere gratitude to Professor Andrea Lucchini for his valuable assistance in establishing Theorem 1.2 and for his careful review of the manuscript. The author also acknowledges the excellent research facilities provided by the Department of Mathematics, IIT Hyderabad, and the mentorship of Dr. Rajesh Kannan for his constant support and motivation.

Statements and Declarations

Competing Interests. The authors have no competing interests to declare that are relevant to the content of this article.

Data Availability

Data sharing is not applicable to this article, as no datasets were used or generated during this study.

References

  1. [1]G. Aalipour, S. Akbari, P. J. Cameron, R. Nikandish, F. Shaveisi, On the structure of the power graph and the enhanced power graph of a group, Electron. J. Combin. 24 (2017), Article No.-P3.16.arxiv.org/abs/1603.04337
  2. [2]J. Brachter, E. Kaja, On groups with chordal power graph, including a classification in the case of finite simple groups, J. Algebraic Combin. 58 (2023), 1095–1124.
  3. [3]D. Bubboloni, F. Fumagalli, C. E. Praeger, Enhanced power graphs of finite groups with cograph structure, Preprint: arXiv:2510.18073 (2025).arxiv.org/abs/2510.18073
  4. [4]P.J. Cameron, P. Manna, R. Mehatari, On finite groups whose power graph is a cograph, J. Algebra 591 (2022), 59–74.DOI
  5. [5]J.H. Conway, R.T. Curtis, S.P. Norton, R.A. Parker, R. A. Wilson, Atlas of Finite Groups, Clarendon Press, Oxford, 1985.
  6. [6]L.E. Dickson, Linear Groups with an Exposition of the Galois Field Theory, Teubner, Leipzig, 1901.
  7. [7]W. van Doorn, E. Judin, P. Monticone, D. Morrison, On some problems from the Kourovka Notebook, Preprint: arXiv:2607.17477 (2026).arxiv.org/abs/2607.17477
  8. [8]D. R. Fulkerson, O. A. Gross, Incidence matrices and interval graphs, Pacific J. Math. 15 (1965), 835–855.DOI
  9. [9]The GAP-Group, Algorithms and Programming, Version 4.12, 2022. Available at: http://www.gap-system.org.
  10. [10]B. Huppert, Endliche Gruppen I, Springer, Berlin, 1967.DOI
  11. [11]B. Huppert, N. Blackburn, Finite Groups III, Springer, Berlin, 1982.DOI
  12. [12]P.B. Kleidman, The maximal subgroups of the Chevalley groups G₂(q) with q odd, the Ree groups ²G₂(q), and their automorphism groups, J. Algebra 117 (1988), 30–71.DOI
  13. [13]P. Manna, Peter J. Cameron, R. Mehatari, Forbidden subgraphs of power graphs, Electron. J. Combin. 28 (2021).DOI
  14. [14]P. Manna, S. Mandal, A. Lucchini, On finite groups whose power graph is claw-free, Dis-crete Math. 348(4) (2025), Article No. 114348.arxiv.org/abs/2407.20110
  15. [15]P. Manna, R. Mehatari, On chordality of the power graph of finite groups, Preprint: arxiv.org/abs/2208.14879 (2022).arxiv.org/abs/2208.14879
  16. [16]X. Ma, S. Zahirović, Y. Lv, Y. She, Forbidden subgraphs in enhanced power graphs of finite groups, Preprint: arXiv:2104.04754 (2021).arxiv.org/abs/2104.04754
  17. [17]M. Rundström, Kourovka Notebook Problem 21.24, solution note (2026).
  18. [18]M. Suzuki, A new type of simple groups of finite order, Proc. Nat. Acad. Sci. U.S.A. 46 (1960), 868–870.pubmed.ncbi.nlm.nih.gov/16590684
  19. [19]M. Suzuki, On a class of doubly transitive groups, Ann. Math. (2) 75 (1962), 105–145.
  20. [20]H.N. Ward, On Ree’s series of simple groups, Trans. Amer. Math. Soc. 121 (1966), 62–89.
  21. [21]R. A. Wilson, The Finite Simple Groups, Springer, London, 2009.DOI

Paper details

vlnc:W_8atrsrvz
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Mathematics

Not recorded for this paper · View statement →

Looking for related papers…
Contents