On coprimality graphs for symmetric groups. (Q2637712)

Let \(G\) be a group, \(X\) be a subset of \(G\) and \(\pi\) be a set of positive integers. We define a graph \(C_\pi(G,X)\) whose vertex set is \(X\) with \(x,y\in X\) joined by an edge provided \(x\neq y\) and the order of \(xy\) is in \(\pi\). Because \(xy\) and \(yx\) are conjugate elements of \(G\), this graph is undirected. If the orders of the elements in \(X\) are coprime to all the integers in \(\pi\), the graph \(C_\pi(G,X)\) is called \(\pi\)-coprimality graph (or just coprimality graph if \(\pi\) is understood). If \(X\) consists of involutions of \(G\) and \(\pi\) consists of all odd positive integers then such graphs have been investigated by the authors [in J. Group Theory 16, No. 1, 35-49 (2013; Zbl 1290.20001)] when \(G\) is a symmetric group and \(X\) is a conjugacy class of involutions. The graphs \(C_{\{2\}}(G,X)\) when \(X\) is a \(G\)-conjugacy class of involutions (commuting involution graphs) have been studied by \textit{C. Bates} et al. [J. Algebra 266, No. 1, 133-153 (2003; Zbl 1034.20003); J. Group Theory 6, No. 4, 461-476 (2003; Zbl 1041.20026); Commun. Algebra 32, No. 11, 4179-4196 (2004; Zbl 1074.20033); J. Algebra 316, No. 2, 849-868 (2007; Zbl 1131.20008); Electron. J. Comb. 16, No. 1, Research Paper R6 (2009; Zbl 1178.05048)]. In this paper, the authors investigate \(C_{p'}(G,X)\) when \(G\) is the symmetric group of degree \(n\) and \(X\) is the \(G\)-conjugacy class of elements of cycle type \(p^r\) where \(p\) is an odd prime and \(r\geq 1\). In this case, the following results are obtained: \(C_{p'}(G,X)\) is connected; if \(r=1\) then \(\text{Diam}(C_{p'}(G,X))=2\) unless \(n=3=p\) when \(\text{Diam}(C_{p'}(G,X))=1\); if \(r<\sqrt p\) then \(\text{Diam}(C_{p'}(G,X))\leq 5\); if \(p\geq 5\) then \(\text{Diam}(C_{p'}(G,X))\leq 5+k\), where \(k\) is the least non-negative integer such that \(r/2^k\leq\sqrt p\).