Variations on the Thompson theorem (Q7008571)

\textit{J. G. Thompson} [Bull. Am. Math. Soc. 74, 383--437 (1968; Zbl 0159.30804)], using his classification of minimal simple groups, obtains the following criterion of solvability: a finite group \(G\) is solvable if and only if every \(2\)-generated subgroup of \(G\) is solvable. It is worth mentioning that a direct proof of this theorem was provided by \textit{P. Flavell} [Invent. Math. 121, No. 2, 279--285 (1995; Zbl 0833.20025)].\N\NThe literature presents several variations of Thompson's theorem. For example, see [\textit{R. M. Guralnick} and \textit{J. S. Wilson}, Proc. Lond. Math. Soc. (3) 81, No. 2, 405--427 (2000; Zbl 1043.20047); \textit{G. Kaplan} and \textit{D. Levy}, Bull. Aust. Math. Soc. 82, No. 2, 265--273 (2010; Zbl 1205.20010); \textit{R. Guralnick} and \textit{G. Malle}, J. Lond. Math. Soc., II. Ser. 85, No. 3, 694--721 (2012; Zbl 1255.20009); \textit{S. Dolfi} et al., J. Lond. Math. Soc., II. Ser. 85, No. 2, 269--281 (2012; Zbl 1246.20015)].\N\NThe present paper presents several interesting variations of Thompson's result. The author prove the following results:\N\NTheorem 1. Let \(G\) be a finite group. Then \(G\) is solvable if and only if for every pair of distinct primes \(p\) and \(q\) and for every pair of elements \(x, y \in G\) with \(x\) a \(p\)-element and \(y\) a \(q\)-element, if \(\langle x,y\rangle\) is solvable, then \(\langle x,y^g\rangle\) is solvable for all \(g \in G\).\N\NTheorem 2. Let \(G\) be a finite group. Then \(G\) is nilpotent if and only if for every pair of distinct primes \(p\) and \(q\) and for every pair of elements \(x, y \in G\) with \(x\) a \(p\)-element and \(y\) a \(q\)-element, if \(\langle x,y\rangle\) is solvable, then \(x\) and \(y^g\) commute for some \(g \in G\).\N\NThe proof of Theorem 1 relies only on Thompson's classification of minimal simple groups, whereas the proof of Theorem 2 depends on the full classification of finite simple groups.\N\NThe author provides some applications in the context of graphs (solvable conjugacy class graph). Moreover, he provides a positive answer to Problem 2.4 by [\textit{P. Bhowal} et al., Discrete Math. 346, No. 8, Article ID 113467, 8 p. (2023; Zbl 1521.20063)].