An answer to a question of Isaacs on character degree graphs. (Q2369428): Difference between revisions

Let \(G\) be a finite group. In recent years, there has been quite some activity studying character degree graphs of finite groups. One way of defining such a graph \(\Gamma(G)\) is to take as vertex set the set of prime divisors of the degrees of the irreducible (complex) characters of \(G\) and to join such primes \(p,q\) by an edge if \(pq\) divides the degree of an irreducible character of \(G\). \textit{I. M. Isaacs} [in Trans. Am. Math. Soc. 356, No. 3, 1155-1183 (2004; Zbl 1034.20009)] began the study of the relative character degree graph \(\Gamma(G|N)\) where \(N\) is normal in \(G\) and attention is restricted to the set \(\text{Irr}(G|N)=\{\chi\in\text{Irr}(G)\mid N\not\leq\ker\chi\}\). The paper under review answers an open question of Isaacs' paper by proving the following Theorem. Let \(N\) be a normal subgroup of \(G\) with \(N\leq G'\). If \(\Gamma(G|N)\) is disconnected, then \(G/N\) is solvable. -- The proof depends on CFSG. By Isaacs' work, only the case that \(N\) is a nonabelian \(p\)-group has to be considered. Along the way, the author finishes work begun by \textit{R. J. Higgs} [Commun. Algebra 26, No. 10, 3133-3140 (1998; Zbl 0937.20002)] by proving the following Theorem. Let \(N\) be normal in \(G\) and let \(\varphi\in\text{Irr}(N)\) be \(G\)-invariant. Assume that \(\chi(1)/\varphi(1)\) is odd for all \(\chi\in\text{Irr}(G|\varphi)\). Then \(G/N\) is solvable.