The graph of the generating \(d\)-tuples of a finite soluble group and the swap conjecture. (Q360161)

Let \(G\) be a finite group and let \(d(G)\) be the minimal number of generators of \(G\). For any integer \(d\geq d(G)\), let \(V_d(G)=\{(g_1,\ldots,g_d)\in G^d\mid\langle g_1,\ldots,g_d\rangle=G\}\). In this paper the connectivity of different graphs whose set of vertices is \(V_d(G)\) is studied. Firstly, the authors consider the ``swap graph'' \(\Delta_d(G)\): two vertices \((x_1,\ldots,x_d),(y_1,\ldots,y_d)\in V_d(G)\) are adjacent in the swap graph if they differ only by one entry. The conjecture that \(\Delta_d(G)\) is connected (``swap conjecture'') was proposed by \textit{R.~F. Tennant} and \textit{E.~C. Turner} [in Rocky Mt. J. Math. 22, No. 3, 1083-1095 (1992; Zbl 0790.20053)]. In the paper under review it is proved that the swap conjecture is true if \(d\geq d(G)+1\), for an arbitrary finite group \(G\) (Theorem 1). The authors also analyze a weaker version of the swap conjecture for the more difficult case when \(d=d(G)\). They define the graph \(\Delta^*_d(G)\) whose vertices are the generating \(d\)-tuples and in which two vertices \((x_1,\ldots,x_d),(y_1,\ldots,y_d)\in V_d(G)\) are adjacent if and only if there exists \(i\in\{1,\ldots,d\}\) such that \(x_i=y_i\). They prove that if \(d\geq 2\) and \(G\) is a \(d\)-generated finite soluble group, then \(\Delta^*_d(G)\) is connected. In fact, a slightly stronger result is proved, considering a graph with fewer edges, namely the graph \(\Lambda_d(G)\) in which two vertices \((x_1,\ldots,x_d),(y_1,\ldots,y_d)\in V_d(G)\) are adjacent if and only there exist \(I\subseteq\{1,\ldots,d\}\) such that \(|I|\geq [d/2]\) and \(x_i=y_i\) for each \(i\in I\). If \(G\) is a \(d\)-generated finite soluble group, with \(d\geq 2\), then the graph \(\Lambda_d(G)\) is connected (Theorem 2).