Abstract
Let S be a nonabelian finite simple group and let n be an integer such that the direct product S ^{n} is 2generated. Let Γ(S ^{n}) be the generating graph of S ^{n} and let Γ _{ n }(S) be the graph obtained from Γ(S ^{n}) by removing all isolated vertices. A recent result of Crestani and Lucchini states that Γ _{ n }(S) is connected, and in this note we investigate its diameter. A deep theorem of Breuer, Guralnick and Kantor implies that diam(Γ _{1}(S))=2, and we define Δ(S) to be the maximal n such that diam(Γ _{ n }(S))=2. We prove that Δ(S)≥2 for all S, which is best possible since Δ(A _{5})=2, and we show that Δ(S) tends to infinity as S tends to infinity. Explicit upper and lower bounds are established for direct powers of alternating groups.
Introduction
Let G be a finite group that can be generated by two elements and let Γ(G) be the generating graph of G; the vertices are the nontrivial elements of G, and two vertices are joined by an edge if and only if they generate G. This fascinating graph encodes many familiar generating properties. For example, G is said to be \(\frac {3}{2}\)generated if every nontrivial element of G belongs to a generating pair; this is equivalent to the nonexistence of isolated vertices in Γ(G). More generally, G has spread at least k if for any k nontrivial elements x _{1},…,x _{ k }∈G, there exists y∈G such that G=〈x _{ i },y〉 for all i (this notion was introduced by Brenner and Wiegold [3] in the 1970s). Visibly, G has spread at least 2 if and only if Γ(G) is connected with diameter 2. Moreover, the graphtheoretic viewpoint suggests many new and natural questions. For instance, one can investigate the connectedness of Γ(G) (and subsequently its diameter), its (co)clique and chromatic numbers, the existence of a Hamiltonian cycle in Γ(G), and so on.
Let S be a nonabelian finite simple group. It is well known that S can be generated by two elements, and there is a vast literature in this area. Indeed, many stronger results have been established in recent years. For example, a theorem of Guralnick and Kantor [17] states that S is \(\frac{3}{2}\)generated (confirming a conjecture of Steinberg [28]), and a more recent result of the same authors (with Breuer) reveals that S has spread at least 2 (see [5]). In particular, it follows that the generating graph Γ(S) has diameter 2. The clique number ω(S) of Γ(S) (that is, the size of the largest complete subgraph) has also been investigated by several authors. In [22], Liebeck and Shalev prove that there is an absolute constant c>0 such that ω(S)≥c⋅m(S) for any S, where m(S) is the minimal index of a proper subgroup of S. In [1], Blackburn shows that if n is a sufficiently large even integer which is indivisible by 4 then ω(A _{ n })=2^{n−2} (and he also proves that this coincides with the chromatic number of Γ(A _{ n })); see [7, 23] for related results. Another recent result reveals that Γ(S) contains a Hamiltonian cycle if S is sufficiently large (see [6]).
Let S ^{n} denote the direct product of n copies of S, and let δ(S) be the largest positive integer n such that S ^{n} is 2generated. A formula of Philip Hall [18] states that
where ϕ _{2}(S) denotes the number of ordered pairs (x,y) such that S=〈x,y〉. In particular, δ(S)=ℙ(S)S/Out(S) where ℙ(S) is the probability that two randomly chosen elements generate S. For example, δ(A _{5})=19. By a striking theorem of Liebeck and Shalev [21] (see also [13, 19]), ℙ(S) tends to 1 as S tends to infinity, whence δ(S) also tends to infinity.
Let n≤δ(S) be a positive integer and consider the generating graph Γ(S ^{n}). If n≥2 then this graph contains isolated vertices, so following [11] we define Γ _{ n }(S) to be the graph obtained from Γ(S ^{n}) by removing all the isolated vertices. By [11, Theorem 1.1], Γ _{ n }(S) is connected, so it is natural to consider its diameter diam(Γ _{ n }(S)). Clearly, if n<δ(S) then diam(Γ _{ n }(S))≤diam(Γ _{ n+1}(S)), and [11, Theorem 1.2] states that diam(Γ _{ n }(S))≤4n−2. In addition, we note that there are examples where the diameter of Γ _{ δ(S)}(S) can be arbitrarily large. Indeed, [11, Theorem 1.3] states that if S=SL_{2}(2^{p}), where p is a prime, then diam(Γ _{ δ(S)}(S))≥2^{p−2}−1 if p is sufficiently large.
We define
Note that diam(Γ _{1}(S))=diam(Γ(S))=2 by the aforementioned theorem of Breuer, Guralnick and Kantor [5, Theorem 1.1], so Δ(S)≥1. Our main result is the following:
Theorem 1
Let S be a nonabelian finite simple group. Then diam(Γ _{2}(S))=2, so Δ(S)≥2. Moreover, Δ(S) tends to infinity as S tends to infinity.
In Proposition 3.8, we show that Δ(A _{5})=2, so the lower bound Δ(S)≥2 in Theorem 1 is best possible. The next theorem provides explicit bounds on Δ(S) when S is an alternating group.
Theorem 2
Let S=A _{ n } be the alternating group of degree n≥5.

(i)
If n is odd then

(ii)
If n is even then
Remark 1
Note that the lower bound in part (ii) of Theorem 2 is linear in n. We refer the reader to Proposition 3.11 for a quadratic lower bound in the special case where n=2p with p an odd prime. It would be interesting to know whether or not a quadratic lower bound exists for all even n.
As one might expect, it appears to be much more difficult to obtain explicit bounds when S is a simple group of Lie type. However, the proof of Theorem 1 does provide the following lower bound on Δ(S). (Here r denotes the untwisted Lie rank of S, which is the rank of the ambient simple algebraic group.)
Theorem 3
There exists an absolute constant c such that if S is a finite simple group of Lie type of rank r over \(\mathbb {F}_{q}\), where q=p ^{f} with p a prime, then either S=Sp_{2r }(2), or
Remark 2
Let us make some remarks on the statement of Theorem 3:

(i)
The proof of Theorem 1 shows that we can take c=1/100 for the constant.

(ii)
The family of symplectic groups over the field of two elements is an anomaly. Indeed, it is well known that this family of groups has some unique generation properties. For example, this is the only infinite family of simple groups with exact spread two (the only other examples are A _{5}, A _{6}, and \(\varOmega _{8}^{+}(2)\))—see [5, Corollary 1.3]. The proof of Proposition 5.5 shows that
where ϕ is the Euler totient function.

(iii)
It is difficult to determine the accuracy of the lower bound in Theorem 3, but it is clear that better bounds hold in certain cases. For example, if S=E _{8}(q), our proof yields Δ(S)≥cf ^{−1} q ^{50} for some constant c (see Remark 5.3 for comments on the case where S is a classical group). Deriving good upper bounds on Δ(S) when S is a group of Lie type appears to be a difficult problem.
Preliminaries
Uniform spread
Let G be a finite group and let X be a subset of G. We say that X has the uniform spread two (UST) property if for any two nontrivial elements a,b∈G there exists an x∈X such that G=〈a,x〉=〈b,x〉. The main theorem of [5] states that if S is a nonabelian finite simple group then there is at least one conjugacy class in S with the UST property. The basic idea is to choose an element z∈S so that the set \(\mathcal{M}(z)\) of maximal subgroups of S containing z is small and can be determined. As explained in [5, Sect. 2], the class C=z ^{S} has the UST property if
for all elements x∈S of prime order, where
denotes the fixed point ratio of x in its natural action on the set of right cosets S/H. In this way, upper bounds on fixed point ratios play an essential role in the proof of [5, Theorem 1.1].
For the remainder of this preliminary section, let S be a nonabelian finite simple group with automorphism group A=Aut(S). Define the integer Δ(S) as in (1).
Proposition 2.1
Let C _{1},…,C _{ t } be distinct Aclasses in S with the UST property. Then Δ(S)≥t.
Proof
This is entirely straightforward. Let x=(x _{1},…,x _{ t }) and y=(y _{1},…,y _{ t }) be distinct vertices in the graph Γ _{ t }(S). Then each x _{ i },y _{ i } is nontrivial, so there exists z _{ i }∈C _{ i } such that S=〈x _{ i },z _{ i }〉=〈y _{ i },z _{ i }〉. Set z=(z _{1},…,z _{ t })∈S ^{t} and consider L=〈x,z〉. By construction, π _{ i }(L)=S for all i, where π _{ i } denotes the ith projection map. Moreover, L is not contained in a diagonal subgroup of S ^{t} since z _{ i } and z _{ j } are not Aconjugate, for all i≠j. Therefore, L=S ^{t}. Similarly, 〈y,z〉=S ^{t}, and the result follows. □
Let X be a subset of S and let S ^{#} be the set of nontrivial elements in S. For a,b∈S ^{#} we define
and
Then X has the UST property if and only if η(X)>0. By [5, Theorem 1.1], with the exception of a short list of known cases, there exists an Sclass C=z ^{S} with η(C)≥1/3. Note that if C′=z ^{A} then C′ has the UST property and η(C′)=η(C).
The next result plays a key role in the proof of our main theorems.
Proposition 2.2
Let \(C_{i} = z_{i}^{A}\), 1≤i≤t, be distinct Aclasses in S with the UST property. For each i, set f _{ i }=η(C _{ i }) and let k _{ i } be a positive integer such that
where α(S)=max{C _{ A }(x) : x∈S ^{#}}. Then Δ(S)≥∑_{ i } k _{ i }.
Proof
We may assume t=1. Set C=C _{1}, z=z _{1}, f=f _{1} and k=k _{1}. It suffices to prove the following claim:
Claim. If k satisfies (4) then any two vertices in Γ _{ k }(S) are connected to a vertex of the form (u _{1},…,u _{ k })∈Γ _{ k }(S), with u _{ i }∈C for all i.
We proceed by induction on k. Since C has the UST property and Γ _{1}(S)=Γ(S), the claim holds when k=1. Now assume k>1, and let (x _{1},…,x _{ k }) and (y _{1},…,y _{ k }) be vertices in Γ _{ k }(S). By induction, the vertices (x _{1},…,x _{ k−1}) and (y _{1},…,y _{ k−1}) in Γ _{ k−1}(S) are connected to a vertex (u _{1},…,u _{ k−1}), where u _{ i }∈C for all i. In particular, the following conditions hold:

(i)
S=〈x _{ i },u _{ i }〉=〈y _{ i },u _{ i }〉 for all 1≤i≤k−1;

(ii)
For all distinct i,j∈{1,…,k−1}, the pairs (x _{ i },u _{ i }) and (x _{ j },u _{ j }) in S ^{2} are not Aconjugate, and nor are the pairs (y _{ i },u _{ i }) and (y _{ j },u _{ j }).
By definition, there are at least fC elements u∈C such that S=〈x _{ k },u〉=〈y _{ k },u〉. Fix i<k and suppose (x _{ i },u _{ i }) is Aconjugate to (x _{ k },u) for some u∈C. Then \(x_{k}=x_{i}^{a}\) for some a∈A and we deduce that there are precisely C _{ A }(x _{ i }) elements u∈C with this property. Similarly, if y _{ i } and y _{ k } are Aconjugate then there are exactly C _{ A }(y _{ i }) elements u∈C such that (y _{ i },u _{ i }) is Aconjugate to (y _{ k },u). It follows that there are at least
choices for u∈C such that (u _{1},…,u _{ k−1},u) is connected to (x _{1},…,x _{ k }) and (y _{1},…,y _{ k }). The result now follows since our choice of k ensures that fC−2(k−1)α(S)>0. □
Computational methods
Let S be a nonabelian finite simple group. In some specific cases (see Proposition 2.3, for example), we can use Magma [2] to find Sclasses with the UST property. Here we briefly outline our methodology.
First, some notation. Let z be a nontrivial element of S and set C=z ^{S}. Our aim is to determine whether or not C has the UST property. As above, let \(\mathcal{M}(z)\) denote the set of maximal subgroups of S containing z. For \(H \in\mathcal{M}(z)\) and x∈S let fpr(x,S/H) be the fixed point ratio of x (see (2)), and let ℙ(x,z) be the probability that x and a randomly chosen element of C do not generate S. Note that
We start with the standard permutation representation of S used by Magma (so for example, if S=PSL_{ n }(q) then this representation has degree (q ^{n}−1)/(q−1)). Using the commands MaximalSubgroups and ConjugacyClasses, we can determine the maximal subgroups of S which contain a conjugate of z; if H is such a subgroup then we can compute the fixed point ratio fpr(z,S/H)=z ^{S}∩H/z ^{S}, and we note that z belongs to exactly S:H⋅fpr(z,S/H) distinct Sconjugates of H. In this way, we can determine the subgroups in \(\mathcal{M}(z)\), and we can subsequently compute σ(x,z) for any x∈S.
Now, if x _{1},x _{2}∈S and σ(x _{ i },z)<1/2 for i=1,2 then (5) implies that ℙ(x _{ i },z)<1/2, so there is some element z∈C such that S=〈x _{1},z〉=〈x _{2},z〉. As previously remarked, if σ(x,z)<1/2 for all nontrivial x∈S (equivalently, for all x∈S of prime order), then C has the UST property and we are done. So let us assume that there are some nontrivial Sclasses \(C_{i} = x_{i}^{S}\), 1≤i≤k, with σ(x _{ i },z)≥1/2. For each x _{ i } we compute ℙ(x _{ i },z) as follows (see Breuer’s notes [4, p. 14]). First, we construct a set of (C _{ S }(z),C _{ S }(x _{ i }))double coset representatives. If r∈S is a representative then 〈x _{ i },z ^{srt}〉=〈x _{ i },z ^{r}〉^{t} for all s∈C _{ S }(z), t∈C _{ S }(x _{ i }), so we only need to test (non)generation for representatives. More precisely, if r _{1},…,r _{ ℓ } are the representatives with \(S \neq \langle x_{i}, z^{r_{j}}\rangle \) then
Subsequently, we define m=max{ℙ(x _{ i },z) : 1≤i≤k}.
As before, if m<1/2 then C has the UST property, so let us assume m≥1/2. Note that ℙ(x,z)≤m for all x∈S ^{#}. Of course, if m=1 then there exists x∈S ^{#} such that S≠〈x,z〉 for all z∈C, so in this situation C does not have the UST property. Suppose m<1 and let y _{1},y _{2}∈S be nontrivial elements such that σ(y _{1},z)<1−m. Then ℙ(y _{1},z)<1−m and ℙ(y _{2},z)≤m, so there exists an element z∈C such that S=〈y _{ i },z〉 for i=1,2. Therefore, it remains to consider the conjugacy classes \(C_{i}=x_{i}^{S}\), 1≤i≤v, such that σ(x _{ i },z)≥1−m. Fix i,j such that 1≤i≤j≤v, and let {y _{1},…,y _{ t }} be a set of representatives of the C _{ S }(x _{ i })orbits on C _{ j }. For each y _{ s } we have to decide if there exists an element g∈S such that S=〈x _{ i },z ^{g}〉=〈y _{ s },z ^{g}〉. In practice, the existence of g can usually be established by testing a few randomly chosen elements, but exhaustive searches are required to prove nonexistence. If we can always find such elements g∈S, for all possible i,j, then C=z ^{S} has the UST property.
By implementing the above procedure in Magma, we obtain the following result (note that the final statement follows immediately from Proposition 2.1).
Proposition 2.3
Let S be one of the following simple groups:
Then there are at least two distinct Aclasses in S with the UST property. In particular, in each case Δ(S)≥2.
Remark 2.4
Let S be one of the groups in the statement of Proposition 2.3. In Table 1, we present an explicit list of Sclasses with the UST property (we adopt the Atlas [10] labelling of classes). In all but three cases, the given list is complete. In the third column, we implicitly exclude the trivial class, and all classes of involutions. Note that there is a unique class in PSL_{2}(9)≅A _{6} with the UST property.
Alternating groups
Let S=A _{ n } be the alternating group of degree n≥5. Recall that we define
where A is the automorphism group of S. The next lemma is easily checked (in general, C _{ A }(x) is maximal when x is a 3cycle).
Lemma 3.1
We have
First, we handle the alternating groups of small degree.
Proposition 3.2
If n∈{5,6,7,8} then diam(Γ _{2}(A _{ n }))=2.
Proof
Set S=A _{ n } and A=Aut(S). If n=7 or 8 then Proposition 2.3 applies (note that A _{8}≅PSL_{4}(2)), so let us assume n=5 or 6. In both cases, there is a unique Aclass of elements in S with the UST property (comprising the elements of order 5 and 4, respectively). Set G=S×S and let V⊂G be the set of vertices in Γ _{2}(S). First, assume n=5. Using Magma [2], it is easy to check that V=59^{2} and V is the union of 16 Gclasses, with representatives {x _{1},…,x _{16}}. By a random search, for each x _{ i } and v∈V we can find an element w∈V such that G=〈x _{ i },w〉=〈v,w〉, hence diam(Γ _{2}(S))=2. The same method applies when n=6 (here V=359^{2} and V comprises 36 distinct Gclasses). □
Proposition 3.3
If n≥9 is odd then
Proof
Let z∈S be an ncycle and set C=z ^{A}. By [5, Proposition 6.7], C has the UST property with corresponding constant η(C)≥1/3 (see (3)). Now C=(n−1)! and α(S)=3(n−3)! (see Lemma 3.1), so the result follows from Proposition 2.2 (setting t=1, C _{1}=C and f _{1}=1/3). □
Proposition 3.4
Suppose n≥10 is even and set ϵ=(2,n/2−1). Then
Proof
Let z∈S be an element with exactly two cycles, of lengths n/2±ϵ, where ϵ=(2,n/2−1). By [5, Proposition 6.3], C=z ^{A} has the UST property and η(C)≥1/3. Now C=n!/(n ^{2}/4−ϵ ^{2}), α(S)=3(n−3)! and once again the result follows from Proposition 2.2. □
Corollary 3.5
The conclusion to Theorem 1 holds if S is an alternating group.
Remark 3.6
The lower bounds obtained in Propositions 3.3 and 3.4 are respectively quadratic and linear in n. It is natural to ask whether or not a better lower bound can be obtained via Proposition 2.1. Let z∈S be an element such that C=z ^{A} has the UST property. Clearly, if z has four or more cycles then 〈z,(1,2,3)〉 is intransitive, so z has at most three cycles. In particular, if n is odd then z is either an ncycle (which is the class used in the proof of Proposition 3.3), or z has exactly three cycles, so there are fewer than n ^{2} possibilities for C. This shows that by simply counting classes we cannot do better than a quadratic function in n. Similarly, if n is even then z has exactly two cycles, and so in this situation we cannot improve on a linear bound in n.
Remark 3.7
It would be interesting to determine all the Aclasses in S with the UST property, but this appears to be a difficult problem. Now, if n≥15 is odd and z∈S has cycleshape (n _{1},n _{2},n _{3}), with n _{ i }≥3 for all i, and (n _{ i },n _{ j })=1 for i≠j, then one can show that z ^{A} has the UST property. Indeed, in this situation the analysis is simplified by the fact that z belongs to exactly three maximal subgroups of S, each of which is intransitive (see the proof of [17, Proposition 7.1]), so S=〈x,z〉 if and only if 〈x,z〉 is transitive. Similarly, if n≥10 is even and z∈S has cycleshape (n _{1},n _{2}), where n _{1} and n _{2} are coprime, then z ^{A} has the UST property.
Next we show that the lower bound Δ(S)≥2 in Theorem 1 is best possible. We note that S=A _{5} is the only finite simple group for which the exact value of Δ(S) is currently known.
Proposition 3.8
We have diam(Γ _{3}(A _{5}))=3, so Δ(A _{5})=2.
Proof
Let S=A _{5}, A=S _{5} and set x=(x _{1},x _{2},x _{3})∈S ^{3} and y=(y _{1},y _{2},y _{3})∈S ^{3}, where x _{ i }=(1,2,3) and y _{ i }=(1,3)(4,5) for all i. It is easy to check that x and y are nonisolated vertices in Γ(S ^{3}). There are exactly 16 elements s∈S such that S=〈x _{1},s〉=〈y _{1},s〉, each of which is a 5cycle, namely
It is straightforward to check that if z _{1},z _{2} and z _{3} are distinct 5cycles with this property then two of the z _{ i } are either C _{ A }(x _{1})conjugate or C _{ A }(y _{1})conjugate. We conclude that there is no z∈S ^{3} such that S ^{3}=〈x,z〉=〈y,z〉, whence diam(Γ _{3}(S))≥3 and thus Δ(S)=2, as claimed.
To see that diam(Γ _{3}(S))=3, we have to work harder. Let z _{1}=(1,2,3,4,5), z _{2}=(1,2,3), and z _{3}=(1,2)(3,4). Set \(C_{i} = z_{i}^{A}\) and note that S ^{#}=C _{1}∪C _{2}∪C _{3}. Let d _{ i } be the degree of z _{ i } in Γ(S) (that is, d _{ i }={x∈S : S=〈x,z _{ i }〉}) and set δ _{ i }=d _{ i }/C _{ A }(z _{ i }). In addition, let α _{ i } (respectively, β _{ i },γ _{ i }) be the number of elements z in C _{1} (respectively, C _{2}, C _{3}) such that S=〈z,z _{ i }〉. It is straightforward to check that these parameters take the following values:
Note that (x _{1},…,x _{ n })∈Γ(S ^{n}) is nonisolated if and only if {x _{ r } : x _{ r }∈C _{ i }}≤δ _{ i } for i=1,2,3. In particular, every vertex in (S ^{#})^{3} is nonisolated. We also note the following:
 (⋆):

Every pair of elements in C _{1}×C _{2} generates S, while (u,v)∈C _{1}×C _{1} is a pair of generators if and only if 〈u〉≠〈v〉.
Let x=(x _{1},x _{2},x _{3}) and y=(y _{1},y _{2},y _{3}) be any two vertices of Γ _{3}(S). To complete the proof of the proposition, it suffices to establish the following:

(i)
x is connected to two vertices u=(u _{1},u _{2},u _{3}) and \(v=(u_{1},u_{2},u_{3}')\) in C _{1}×C _{2}×C _{1} with \(\langle u_{3} \rangle \neq \langle u_{3}' \rangle \);

(ii)
y is connected to a vertex in C _{2}×C _{1}×C _{1};

(iii)
Every vertex in C _{2}×C _{1}×C _{1} is connected to u or v.
First, consider (i). A vertex t=(t _{1},t _{2},t _{3}) in C _{1}×C _{2}×C _{1} is connected to x if and only if S=〈x _{ i },t _{ i }〉 for all i and (x _{1},t _{1}) is not Aconjugate to (x _{3},t _{3}) (since t is in C _{1}×C _{2}×C _{1}, (x _{2},t _{2}) cannot be Aconjugate to (x _{1},t _{1}) or (x _{3},t _{3})). As recorded in the above table, any nontrivial element in S generates with at least 16 elements in C _{1} and with at least 6 elements in C _{2}. Hence, there are at least 16⋅6=96 choices for (t _{1},t _{2})∈C _{1}×C _{2} such that S=〈x _{1},t _{1}〉=〈x _{2},t _{2}〉.
Let (u _{1},u _{2})∈C _{1}×C _{2} be one of these choices and set
so \(u \in T_{u_{1},u_{2}}\) if and only if u∈C _{1}, S=〈x _{3},u〉 and the pairs (x _{1},u _{1}), (x _{3},u) are not Aconjugate. If x _{1} and x _{3} are not Aconjugate then \(T_{u_{1},u_{2}} \geq16\) (in this situation, \(u \in T_{u_{1},u_{2}}\) if and only if u∈C _{1} and S=〈x _{3},u〉). On the other hand, if \(x_{3}=x_{1}^{\alpha}\) for some α∈A then there are C _{ A }(x _{1}) choices for y∈C _{1} such that (x _{1},u _{1}) is Aconjugate to (x _{3},y). Since x _{3} generates with at least 16 elements in C _{1}, and C _{ A }(x _{1})≤8, it follows that \(T_{u_{1},u_{2}}\geq8\). Therefore, in every case we have \(T_{u_{1},u_{2}} \ge8\), so we can find \(u_{3},u_{3}' \in T_{u_{1},u_{2}}\) such that \(\langle u_{3}\rangle \neq \langle u_{3}'\rangle \). This establishes (i), with u=(u _{1},u _{2},u _{3}) and \(v=(u_{1},u_{2},u_{3}')\). By symmetry, (ii) also holds.
Finally, let us turn to (iii). Let t=(t _{1},t _{2},t _{3}) be a vertex in C _{2}×C _{1}×C _{1}. Then u is connected to t if and only if S=〈t _{ i },u _{ i }〉 for all i, so (⋆) implies that u is connected to every vertex in the set {(t _{1},t _{2},t _{3})∈C _{2}×C _{1}×C _{1} : t _{3}∉〈u _{3}〉}. Similarly, v is connected to every vertex in the set \(\{ (t_{1},t_{2},t_{3}) \in C_{2} \times C_{1} \times C_{1} \,:\, t_{3} \notin \langle u_{3}' \rangle \}\). Therefore, (iii) holds and the proof of the proposition is complete. □
We now consider upper bounds on Δ(A _{ n }), with the aim of establishing Theorem 2.
Proposition 3.9
Let S=A _{ n } with n≥6. Set ξ=6 if n is even, otherwise ξ=8. Then
Proof
Let s=(1,2,3)∈S and suppose σ∈S is a permutation such that S=〈s,σ〉. Let fix(σ) be the set of fixed points of σ. Since 〈s,σ〉 is transitive, fix(σ)≤2 and σ has at most 3−fix(σ) cycles.
First, assume n is even. The following three cases arise:

(i)
If fix(σ)=0 then σ has exactly two cycles (since n is even).

(ii)
If fix(σ)=1 then σ is an (n−1)cycle, and the fixed point is 1,2 or 3.

(iii)
If fix(σ)=2 then σ has to be an (n−2)cycle, but there are no such permutations in S (since n is even).
Let k be the number of pairwise nonAconjugate pairs (s,σ) such that S=〈s,σ〉 and fix(σ)=0. Then k=F/C _{ A }(s), where F is the set of fixedpointfree permutations σ∈S with S=〈s,σ〉. Note that F⊆T, where
As observed above, if 〈s,σ〉 is transitive and fix(σ)=0 then σ has exactly two cycles. Let 1<a≤n/2 be an integer and let T _{ a } be the set of permutations σ∈S of shape (a,n−a) such that 〈s,σ〉 is transitive. Note that \(T=\bigcup_{a=2}^{n/2}T_{a}\). It is easy to check that if a<n/2 then
and similarly
We conclude that
In particular, since C _{ A }(s)=3(n−3)!, it follows that
Let x=(x _{1},…,x _{ k },x _{ k+1})∈Γ _{ k+1}(S) and y=(y _{1},…,y _{ k },y _{ k+1})∈Γ _{ k+1}(S), where x _{ i }=(1,2,3) and y _{ i }=(4,5,6) for all i. (Note that x (and also y) is a nonisolated vertex in Γ(S ^{k+1}); indeed, by definition of k there exists z=(z _{1},…,z _{ k+1})∈S ^{k+1} with S ^{k+1}=〈x,z〉, where each z _{ i } with i≤k is a fixedpointfree permutation, and z _{ k+1} has a single fixed point.) Since x _{ i } and y _{ i } have disjoint support, there is no element σ∈S with fixed points such that S=〈x _{ i },σ〉=〈y _{ i },σ〉. In particular, if z=(z _{1},…,z _{ k+1})∈S ^{k+1} and S ^{k+1}=〈x,z〉=〈y,z〉 then each z _{ i } must be fixedpointfree, but the definition of k implies that 〈x,z〉 is a proper subgroup of S ^{k+1}, a contradiction. We conclude that
A similar argument applies when n is odd. Here the following three cases arise:

(i)
If fix(σ)=0 then σ has at most three cycles, so either σ is an ncycle, or σ has exactly three cycles.

(ii)
If fix(σ)=1 then σ has exactly two cycles, and the fixed point is 1,2 or 3.

(iii)
If fix(σ)=2 then σ is an (n−2)cycle and fix(σ)={1,2},{1,3} or {2,3}.
Define k, F and T as before, and set
Note that if n=3m and σ is a permutation with precisely three cycles of length m then 〈s,σ〉 is contained in a maximal imprimitive subgroup of S of type S _{3}≀S _{ m }.
In order to define certain subsets of P and T, set
and
For a∈I, let P _{ a,a } (respectively, T _{ a,a }) be the set of permutations σ∈S of shape (a,a,n−2a) such that 〈s,σ〉 is primitive (respectively, transitive). Similarly, for (a,b)∈J let P _{ a,b } (respectively, T _{ a,b }) be the set of permutations σ∈S of shape (a,b,n−a−b) such that 〈s,σ〉 is primitive (respectively, transitive). Note that
It is straightforward to check that T _{0,0}=(n−1)! and
if a∈I is nonzero. Similarly, if (a,b)∈J then
and we calculate that
and
Therefore,
and thus
since C _{ A }(s)=3(n−3)!. We now complete the argument as in the n even case to get
as required. □
By combining Propositions 3.3 and 3.9, we obtain the following quadratic bounds on Δ(S) when S is an alternating group of odd degree.
Corollary 3.10
If n≥9 is odd then
This completes the proof of Theorem 2. Note that when n is even, Proposition 3.4 provides a linear lower bound on Δ(A _{ n }). As the next result demonstrates, a quadratic lower bound can be established in some special cases.
Proposition 3.11
Suppose S=A _{ n }, where n=2p with p>3 a prime. Then
Proof
Let C _{ h } be the S _{ n }class of permutations in S of shape (a,2p−a), where a=2h+1 is odd and 1≤h≤(p−3)/2. Let σ _{1},σ _{2}∈S be nontrivial permutations and set
and
Note that ζ(C _{ h })=C _{ h }η(C _{ h }) (see (3)). Since a is odd and a≤p−2, it follows that the integers a and 2p−a are coprime, whence S=〈z,σ _{ i }〉 if and only if 〈z,σ _{ i }〉 is transitive. We claim that
Clearly, in order to establish this lower bound, we may assume that each σ _{ i } has prime order. Write σ _{1}=σ _{1,1}⋯σ _{1,r } and σ _{2}=σ _{2,1}⋯σ _{2,s } as disjoint cycles, where each σ _{ i,j } has prime length. There are two cases to consider.
First, suppose σ _{1,i }=σ _{2,j } for some i,j. In this case,
and the desired bound follows.
Now assume σ _{1,i }≠σ _{2,j } for all i,j. Given π∈S _{ n }, let supp(π) denote the support of π. Then there exists {x _{1},x _{2}}∈supp(σ _{1,1}) and {y _{1},y _{2}}∈supp(σ _{2,1}) such that either {x _{1},x _{2}}∩{y _{1},y _{2}}=∅ or {x _{1},x _{2}}∩{y _{1},y _{2}}={x _{1}}={y _{1}}. In the former situation, we have
while in the latter case we calculate that
This establishes the lower bound in (6).
Now Lemma 3.1 states that α(S)=3(n−3)!, so Proposition 2.2 yields
Finally, by using the lower bound on ζ(C _{ h }) in (6), we calculate that
as required. □
Sporadic groups
Proposition 4.1
The conclusion to Theorem 1 holds if S is a sporadic group.
Proof
Let S be a sporadic simple group and let z∈S be an element in the Sclass recorded in the second column of [5, Table 7]. Then [5, Lemma 6.1] states that C=z ^{A} has the UST property with corresponding constant η(C)≥1/3 (see (3)) and the desired bound Δ(S)≥2 quickly follows from Proposition 2.2. (Note that α(S) can be easily calculated from the character table of S – see [10].) For example, if S=M_{11} and we take C=z ^{S} to be the class 11A then C=720, η(C)=1/3, α(S)=48 and we deduce that Δ(S)≥3. The remaining cases are entirely similar. □
Classical groups
In this section, we establish Theorems 1 and 3 for classical groups.
Proposition 5.1
Let S be a finite simple classical group over \(\mathbb {F}_{q}\) with automorphism group A. Write q=p ^{f} where p is a prime. Then α(S)≤Λ, where Λ is given in Table 2.
Proof
Let G=Inndiag(S) be the group of innerdiagonal automorphisms of S. Define d and Q as in Table 2. Let x∈S be an element of prime order and define the integer ν(x) as in [8, Definition 3.16] (so ν(x) is the codimension of the largest eigenspace of a lift \(\hat{x} \in\mathrm{GL}(V)\) of x on \(V \otimes\bar{\mathbb {F}}_{q}\), where V is the natural Smodule). Note that C _{ A }(x)≤C _{ A }(x ^{i}) for all i≥1, so we only need to consider elements of prime order.
First, assume S=PSL_{ n }(q). If n=2 then it is easy to check that C _{ G }(x)≤d(q+1) and thus C _{ A }(x)≤df(q+1) since A:G=f. If n≥3 then [8, Corollary 3.38] implies that \(x^{G}>\frac{1}{2}q^{2n2}\), so \(C_{G}(x)<2q^{n^{2}2n+1}\) (since \(G<q^{n^{2}1}\)), and we deduce that \(C_{A}(x)<4fq^{n^{2}2n+1}\) since A:G=2f. An entirely similar argument applies when S is a unitary group.
Next suppose S=PSp_{ n }(q)′. First, observe that if x is a transvection then
Now, if n=4 and q is even then it is easy to check that C _{ G }(x) is maximal when x is a transvection, so C _{ G }(x)≤q ^{4}(q ^{2}−1) and thus C _{ A }(x)≤fq ^{4}(q ^{2}−1) (note that a transvection is not centralized by a graph automorphism of S). On the other hand, if n=4 and q is odd then C _{ G }(x)≤2Sp_{2}(q)^{2}=2q ^{2}(q ^{2}−1)^{2}, so C _{ A }(x)≤2fq ^{2}(q ^{2}−1)^{2}. Now assume n≥6. If x is not a transvection then ν(x)≥2 and thus [8, Corollary 3.38] yields \(x^{G}>\frac{1}{4}Q^{1}q^{2n4}\). We deduce that transvections have the largest centralizers, so C _{ G }(x)<q ^{n(n−1)/2} and thus C _{ A }(x)<fq ^{n(n−1)/2}.
Finally, let us assume S is an orthogonal group. If n is even and (n,ϵ)≠(8,+) then we apply [8, Corollary 3.38] as before, noting that ν(x)≥2 since x∈S. Similarly, if (n,ϵ)=(8,+) then x ^{G} is minimal when x is a long root element, in which case C _{ G }(x)=q ^{12}(q ^{2}−1)^{3} and thus C _{ A }(x)<6fq ^{18} since A:G=6f. Finally, suppose n is odd. We claim that \(C_{G}(x)<2q^{n^{2}/23n/2+1}\). If ν(x)≥2 then [8, Corollary 3.38] gives \(x^{G}>\frac{1}{4}Q^{1}q^{2n6}\) and the claim follows. On the other hand, if ν(x)=1 then x is an involution and \(C_{G}(x) \le2\mathrm{SO}_{n1}^{}(q)<2q^{n^{2}/23n/2+1}\). This justifies the claim, and we conclude that \(C_{A}(x)<4fq^{n^{2}/23n/2+1}\). □
Proposition 5.2
The conclusions to Theorems 1 and 3 hold when S=PSL_{ n }(q).
Proof
First, assume n=2. If q<29 (and q≠9) then Proposition 2.3 applies, so we may assume q≥29 (note that PSL_{2}(9)≅A _{6}, so Proposition 3.2 applies in this case). Then Proposition 5.1 states that α(S)≤df(q+1), and [5, Proposition 5.24] provides an Aclass C with η(C)≥1/3 (see (3)) and C≥q(q−1). Therefore, by applying Proposition 2.2, we deduce that
Now consider the general case n≥3. Here \(\alpha (S)\le4fq^{n^{2}2n+1}\) and, by inspecting [5, Table 5 and Sect. 5.12], we see that there exists an Aclass C of regular semisimple elements with η(C)≥1/3. Therefore, \(C > \frac{1}{2}q^{n(n1)}\), and thus Proposition 2.2 implies that
This bound is sufficient unless n=3 (with q<11), n=4 (with q<5) or (n,q)=(5,2), (6,2). In each of these exceptional cases, Proposition 2.3 applies. □
Remark 5.3
The lower bounds obtained in the proof of Proposition 5.2 are good enough to establish Theorems 1 and 3 when S=PSL_{ n }(q), but they can be improved. For example, suppose S=PSL_{ n }(q) with n≥12. Let z∈S be a regular semisimple element which lifts to an element \(\hat{z} \in\mathrm{SL}_{n}(q)\) of order lcm(q ^{e}−1,q ^{n−e}−1)/(q−1), where
(Here \(\hat{z}\) preserves a decomposition V=U⊕W of the natural SL_{ n }(q)module V, acting irreducibly on both U and W, with dimU=e. Also note that (e,n−e)=1.) By [5, Proposition 5.23], the Sclass C=z ^{S} has the UST property, with η(C)≥1/2. Indeed, \(\hat{z}\) is contained in exactly two maximal subgroups of SL_{ n }(q); namely, the stabilizers of the subspaces U and W. Let N be the number of distinct Aclasses in S containing regular semisimple elements of this form. By considering the possible eigenvalues of \(\hat {z}\) (in \(\bar{\mathbb{F}}_{q}\)), it is easy to see that
where ϕ is the Euler totient function. Therefore, by arguing as in the proof of Proposition 5.2, using Proposition 2.2, we obtain a better lower bound
By carefully inspecting [5, Sect. 5], similar lower bounds on the number of Aclasses with the UST property can be derived for any classical group S. However, we do not have a good upper bound on Δ(S) when S is a group of Lie type, so the accuracy of the improved lower bounds is difficult to determine.
Proposition 5.4
The conclusions to Theorems 1 and 3 hold when S=PSU_{ n }(q).
Proof
If n=3 (and q<11), n=4 (and q<5) or (n,q)=(5,2),(6,2) then Proposition 2.3 applies, so let us assume otherwise. By inspecting [5, Propositions 5.21, 5.22], it follows that there exists an Aclass C with η(C)≥1/3 and
As before, by applying Proposition 2.2 and the upper bound on α(S) recorded in Table 2, we deduce that
This bound is sufficient unless (n,q)=(7,2). Here
(see [5, Proposition 5.21]), and, by applying Proposition 2.2, we deduce that Δ(S)≥6. □
Proposition 5.5
The conclusions to Theorems 1 and 3 hold when S=PSp_{ n }(q)′.
Proof
First, assume n=4. If 2<q<5 then Proposition 2.3 applies (see Proposition 3.2 for the case q=2, since PSp_{4}(2)′≅A _{6}). Suppose q≥5. By [5, Propositions 5.8, 5.12], there exists an Aclass C with C≥q ^{4}(q ^{2}−1)^{2} and η(C)≥1/3. In the usual way, via Propositions 2.2 and 5.1, we deduce that Δ(S)≥⌈q ^{2}/12f⌉ and the result follows.
Now assume n≥6. The case q=2 requires special attention; indeed, this is one of the exceptional cases recorded in [5, Theorem 1.1]. By [5, Proposition 5.8], if z∈S is an irreducible element of order 2^{n/2}+1 then C=z ^{S} has the UST property. Now there are precisely ϕ(2^{n/2}+1)/n distinct Aclasses of such elements, so Proposition 2.1 implies that
It is easy to check that this bound implies that Δ(S)≥2 when 8≤n≤14. In general, if we write \(2^{n/2}+1=\prod_{i}p_{i}^{a_{i}}\), where the p _{ i } are distinct primes, then
The subsequent bound
is sufficient for all n≥16. The case (n,q)=(6,2) is covered by Proposition 2.3.
Finally, let us assume n≥6 and q≥3. By inspecting [5, Propositions 5.8, 5.10, 5.12], we see that there exists an Aclass C with η(C)≥1/3 and
The desired result now follows in the usual way via Proposition 2.2, using the upper bound on α(S) given in Table 2. □
Proposition 5.6
The conclusions to Theorems 1 and 3 hold when \(S=\mathrm{P\varOmega }_{n}^{\epsilon }(q)\).
Proof
We may assume n≥7. First, suppose (n,ϵ)=(8,+). If q=2 then Proposition 2.3 applies. Now if q=3 then [5, Table 3] indicates that there is an Aclass C=z ^{A} in S with the UST property, where z=20 and η(C)≥2(1−195/455)=67/455 (here z preserves an orthogonal decomposition 8^{+}=4^{−}⊥4^{−} of the natural Smodule into nondegenerate 4spaces of minus type). We calculate that
and thus Proposition 2.2 implies that Δ(S)≥34. Similarly, if q=4 then [5, Table 3] provides an Aclass C=z ^{A} in S with z=65 (preserving a decomposition 8^{+}=2^{−}⊥6^{−}), η(C)≥1/3 and
Once again, the desired result follows by applying Proposition 2.2.
Next assume (n,ϵ)=(8,+) and q≥5. By [5, Lemma 5.15], there is an Aclass C with
and η(C)≥1/3. According to Proposition 5.1, we have α(S)≤6fq ^{18}, so Proposition 2.2 implies that
It is easy to check that this bound is always sufficient.
For the remainder we may assume that (n,ϵ)≠(8,+). We first deal with the case where n is odd and q=3. Note that if n≡1(mod4) then S is one of the exceptional cases recorded in [5, Theorem 1.1]. In view of Proposition 2.3, we may assume that n≥9. By [5, Propositions 5.7, 5.19], there is an Aclass C in S such that
and η(C)≥1/3. By combining this lower bound with the upper bound on α(S) given in Proposition 5.1, we quickly deduce that Proposition 2.2 yields
and this bound is sufficient unless n=9. Here \(\alpha (S)=2\mathrm{SO}_{8}^{+}(3)\) and there is an Aclass C such that η(C)≥1/3 and C=SO_{9}(3)/82 (see [5, Proposition 5.7]). In the usual way, via Proposition 2.2, we deduce that Δ(S)≥7.
The remaining cases are very similar. By inspecting [5, Sections 5.6, 5.8, 5.9], it follows that there is an Aclass C=z ^{A} in S of regular semisimple elements such that η(C)≥1/3 and
where r denotes the rank of S, and ι=1/2 if n is odd, otherwise ι=0. The result now follows in the usual way, via Propositions 5.1 and 2.2. For example, if n is even then we deduce that
and this bound is sufficient unless (n,q)=(8,2), which is one of the cases handled in Proposition 2.3. □
Exceptional groups
Here we complete the proof of Theorems 1 and 3 by dealing with the exceptional groups of Lie type.
Proposition 6.1
Let S be a finite simple exceptional group of Lie type over \(\mathbb {F}_{q}\), where q=p ^{f} with p a prime. Then α(S)≤Λ, where Λ is given in Table 3.
Proof
Detailed information on the conjugacy classes in S can be found in the literature, and the result follows by inspecting the relevant lists of conjugacy class sizes. For example, let S=E _{8}(q) and let x∈S be an element of prime order. The sizes of the unipotent classes in S are conveniently listed in [20, Table 22.2.1], and it is easy to see that C _{ S }(x)≤q ^{57}E _{7}(q), with equality if and only if x is a long root element. For semisimple x, the possibilities for C _{ S }(x) are listed in [16] and it is easy to check that C _{ S }(x)≤E _{7}(q)SL_{2}(q). Since A:S=f (where A=Aut(S)) we conclude that α(S)≤fq ^{57}E _{7}(q) as claimed. The other cases are very similar and we leave the reader to check the details. (See [15, 20] for the sizes of conjugacy classes in E _{7}(q) and \(E_{6}^{\epsilon }(q)\); [24, 26] for F _{4}(q), [9, 14] for G _{2}(q), [25] for ^{2} F _{4}(q), [30] for ^{2} G _{2}(q), [29] for ^{2} B _{2}(q) and [12, 27] for ^{3} D _{4}(q).) □
Proposition 6.2
The conclusion to Theorem 1 holds when S is a finite simple exceptional group of Lie type.
Proof
By [5, Lemma 6.2], there exists an Aclass C=z ^{A} of regular semisimple elements in S with η(C)≥1/3 (see [17, Propositions 6.1, 6.2]). The desired result now follows via Proposition 2.2, using the upper bound on α(S) in Proposition 6.1 and a suitable lower bound on C. For example, suppose S=G _{2}(q)′. If q=2 then S≅PSU_{3}(3) and thus Proposition 5.4 applies. For q>2 we have \(C>\frac {1}{2}Q^{2}q^{12}\) (where Q=(q+1)/q as before) and α(S)<2fq ^{8}, so Proposition 2.2 yields
It is easy to check that this bound gives the desired result. Similarly, if S=^{2} G _{2}(q)′ (so that q=3^{2m+1} for some positive integer m) then
and we deduce that
This bound is sufficient if q>3, while Proposition 5.2 applies if q=3 (since S≅PSL_{2}(8)). The remaining cases are entirely similar. □
This completes the proof of Theorems 1 and 3.
References
Blackburn, S.R.: Sets of permutations that generate the symmetric group pairwise. J. Comb. Theory, Ser. A 113, 1572–1581 (2006)
Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system I: the user language. J. Symb. Comput. 24, 235–265 (1997)
Brenner, J.L., Wiegold, J.: Twogenerator groups I. Mich. Math. J. 22, 53–64 (1975)
Breuer, T.: GAP computations concerning the probabilistic generation of finite simple groups. Preprint arXiv:0710.3267
Breuer, T., Guralnick, R.M., Kantor, W.M.: Probabilistic generation of finite simple groups, II. J. Algebra 320, 443–494 (2008)
Breuer, T., Guralnick, R.M., Lucchini, A., Maróti, A., Nagy, G.P.: Hamiltonian cycles in the generating graph of finite groups. Bull. Lond. Math. Soc. 42, 621–633 (2010)
Britnell, J.R., Evseev, A., Guralnick, R.M., Holmes, P.E., Maróti, A.: Sets of element that pairwise generate a linear group. J. Comb. Theory, Ser. A 115, 442–465 (2008)
Burness, T.C.: Fixed point ratios in actions of finite classical groups, II. J. Algebra 309, 80–138 (2007)
Chang, B.: The conjugate classes of Chevalley groups of type (G _{2}). J. Algebra 9, 190–211 (1968)
Conway, J., Curtis, R., Norton, S., Parker, R., Wilson, R.: Atlas of Finite Groups. Oxford University Press, London (1985)
Crestani, E., Lucchini, A.: The nonisolated vertices in the generating graph of direct powers of simple groups. J. Alg. Combin. (2012). doi:10.1007/s1080101203651
Deriziotis, D.I., Michler, G.: Character table and blocks of the finite simple triality groups ^{3} D _{4}(q). Trans. Am. Math. Soc. 303, 39–70 (1987)
Dixon, J.D.: The probability of generating the symmetric group. Math. Z. 110, 199–205 (1969)
Enomoto, H.: The conjugacy classes of Chevalley groups of type (G _{2}) over finite fields of characteristic 2 or 3. J. Fac. Sci. Univ. Tokyo 16, 497–512 (1970)
Fleischmann, P., Janiszczak, I.: The semisimple conjugacy classes of finite groups of Lie type E _{6} and E _{7}. Commun. Algebra 21, 93–161 (1993)
Fleischmann, P., Janiszczak, I.: The semisimple conjugacy classes and the generic class number of the finite simple groups of Lie type E _{8}. Commun. Algebra 22, 2221–2303 (1994)
Guralnick, R.M., Kantor, W.M.: Probabilistic generation of finite simple groups. J. Algebra 234, 743–792 (2000)
Hall, P.: The Eulerian functions of a group. Q. J. Math. 7, 134–151 (1936)
Kantor, W.M., Lubotzky, A.: The probability of generating a finite classical group. Geom. Dedic. 36, 67–87 (1990)
Liebeck, M.W., Seitz, G.M.: Unipotent and Nilpotent Classes in Simple Algebraic Groups and Lie Algebras. Monographs and Surveys Series, vol. 180. Am. Math. Soc., Providence (2012)
Liebeck, M.W., Shalev, A.: The probability of generating a finite simple group. Geom. Dedic. 56, 103–113 (1995)
Liebeck, M.W., Shalev, A.: Simple groups, probabilistic methods, and a conjecture of Kantor and Lubotzky. J. Algebra 184, 31–57 (1996)
Lucchini, A., Maróti, A.: On the clique number of the generating graph of a finite group. Proc. Am. Math. Soc. 137, 3207–3217 (2009)
Shinoda, K.: The conjugacy classes of Chevalley groups of type (F _{4}) over finite fields of characteristic 2. J. Fac. Sci. Univ. Tokyo 21, 133–159 (1974)
Shinoda, K.: The conjugacy classes of the finite Ree groups of type (F _{4}). J. Fac. Sci. Univ. Tokyo 22, 1–15 (1975)
Shoji, T.: The conjugacy classes of Chevalley groups of type (F _{4}) over finite fields of characteristic p≠2. J. Fac. Sci. Univ. Tokyo 21, 1–17 (1974)
Spaltenstein, N.: Caractères unipotents de \({}^{3}D_{4}(\mathbb {F}_{q})\). Comment. Math. Helv. 57, 676–691 (1982)
Steinberg, R.: Generators for simple groups. Can. J. Math. 14, 277–283 (1962)
Suzuki, M.: On a class of doubly transitive groups. Ann. Math. 75, 105–145 (1962)
Ward, H.N.: On Ree’s series of simple groups. Trans. Am. Math. Soc. 121, 62–89 (1966)
Acknowledgements
Burness is supported by EPSRC grant EP/I019545/1, and he thanks the Dipartimento di Matematica at the Università degli Studi di Padova for their generous hospitality. Crestani is supported by a grant from Fondazione Ing. Aldo Gini. Both authors thank Andrea Lucchini and Pablo Spiga for helpful comments.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Burness, T.C., Crestani, E. On the generating graph of direct powers of a simple group. J Algebr Comb 38, 329–350 (2013). https://doi.org/10.1007/s108010120405x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s108010120405x
Keywords
 Finite simple groups
 Generating graph
 Diameter
 Spread