Finite groups with non-complete character codegree graphs (Q7008220)

Let \(G\) be a finite group. The character codegree of an irreducible complex character \(\chi\) of \(G\) is defined as\N\[\N\mathrm{cod}(\chi) = \frac{|G: \ker(\chi)|}{\chi(1)}.\N\]\NThe character codegree graph \(\Gamma(G)\) has as vertex set \(\pi(G)\) the set of prime divisors of \(|G|\). Distinct vertices \(p\) and \(q\) are adjacent if there exists an irreducible character of \(G\) whose codegree is divisible by \(pq\).\N\NThis paper investigates structural properties of finite groups \(G\) whose character codegree graph \(\Gamma(G)\) is not complete, with particular focus on the case where \(\mathrm{diam}(\Gamma(G)) = 3\).\N\NThe author provides a complete characterization of finite non-solvable groups \(G\) for which \(\Gamma(G)\) has diameter \(3\). The main result (Theorem A) shows that in such cases, the group \(G\) has a partition of \(\pi(G)\) into four parts \(\{p\} \cup \mu \cup \nu \cup \{q\}\) and admits subgroups \(U\), \(P\), \(Q\) with \(P \in \mathrm{Syl}_p(G)\), \(Q \in \mathrm{Syl}_q(G)\) and \(U\) a Hall subgroup for \(\{p\} \cup \mu\) with specific Frobenius or \(2\)-Frobenius decompositions involving \(P\), \(Q\) and \(F(G)\). Moreover, \(G\) is closely related to Frobenius or \(2\)-Frobenius groups but not itself of those types.\N\NIn addition, the paper proves that for every subgroup \(H \leq G\), the character codegree graph \(\Gamma(H)\) is a subgraph of \(\Gamma(G)\) (Theorem B). The author also studies conditions under which the non-completeness of \(\Gamma(G)\) implies the existence of certain Hall \(\{p,q\}\)-subgroups with Frobenius or \(2\)-Frobenius structure (Theorem C).\N\NAn illustrative example (Example 2.2) is given, involving a solvable group \(G\) with abelian Sylow subgroups such that \(\Gamma(G)\) properly contains the element order graph \(\Gamma_e(G)\).