Groups having complete bipartite divisor graphs for their conjugacy class sizes. (Q2356000)

The set of conjugacy class sizes of a finite group \(G\) is \(\mathrm{cs}(G)=\{|g^G|:g\in G\}\). The \textit{bipartite divisor graph} of \(G\) is the bipartite graph whose bipartition is \(\mathrm{cs}(G)\setminus\{1\}\) and the set of prime numbers \(p\) that divide some element of \(\mathrm{cs}(G)\), and with \(\{n,p\}\) being an edge if and only if \(\gcd(n,p)\neq 1\). In this paper the authors construct infinitely many groups whose bipartite divisor graph is the complete bipartite graph \(K_{2,5}\).