The commuting graph of minimal nonsolvable groups (Q5956144)

Let \(G\) be a finite group. If \(G\) is not solvable but every proper quotient of \(G\) is solvable, then \(G\) is called minimal nonsolvable. The commuting graph of \(G\) is the graph whose vertex set is \(G-\{1\}\) and whose edges are pairs of commuting elements of \(G\). The author established [in Ann. Math. (2) 149, No. 1, 219-251 (1999; Zbl 0935.20009)] a close connection between the commuting graph of a finite group and finite quotients of the multiplicative group of a finite dimensional division algebra and formulated [in Bull. Aust. Math. Soc. 59, No. 1, 105-110 (1999; Zbl 0927.16011)] the conjecture FSoQ on the solvability of such quotients. The main theorem of the present paper is the following: the commuting graphs of finite minimal nonsolvable groups have diameter \(\geq 3\). An example showing that this result is the best possible is given. In the proof of the main theorem, some interesting results about the actions of solvable permutation groups on partitions of finite sets are used. The author notes that the conjecture FSoQ was proved recently by A. Rapinchuk, G. Seitz and the author.