Boundedly generated subgroups of finite groups. (Q2905099)

As stated by the authors, the starting point for this paper was the question whether every finite group \(G\) contains a two-generated subgroup \(H\) such that \(\pi(H)=\pi(G)\). They were able to answer in the affirmative the question proving a stronger result:NEWLINENEWLINE (Theorem A.) Let \(\mathcal C(G)\) be the set of isomorphism classes of composition factors of a finite group \(G\). Then there exists a \(2\)-generated subgroup \(H\leq G\) such that \(\mathcal C(H)=\mathcal C(G)\).NEWLINENEWLINE The paper also contains other results of similar vein.NEWLINENEWLINE (Theorem D.) Let \(G\) be a finite group. Then there exists a \(4\)-generated subgroup \(H\leq G\) such that \(H\) has the same exponent as \(G\).NEWLINENEWLINE It is unknown whether the bound in Theorem C is bigger than \(2\), but for soluble groups it is proved the followingNEWLINENEWLINE (Theorem E.) Let \(G\) be a finite soluble group. Then there exists a \(2\)-generated subgroup \(H\leq G\) such that \(H\) has the same exponent as \(G\).NEWLINENEWLINE Denote by \(\Gamma(G)\) the prime graph of a finite group \(G\). This is the graph whose set of vertices is \(\pi(G)\) and \(p,q\in\pi(G)\), with \(p\neq q\), are connected by an edge if and only if \(G\) has an element of order \(pq\).NEWLINENEWLINE (Theorem C.) Let \(G\) be a finite group. Then there exists a \(3\)-generated subgroup \(H\leq G\) such that \(\Gamma(H)=\Gamma(G)\). (And this bound is sharp.)