Beschreibung:
<p>We connect two nonlinear irreducible character of a finite group <inline-formula content-type="math/mathml">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper G">
<mml:semantics>
<mml:mi>G</mml:mi>
<mml:annotation encoding="application/x-tex">G</mml:annotation>
</mml:semantics>
</mml:math>
</inline-formula> if their degrees have a common prime divisor. In this paper we show that the corresponding graph has at most three connected components.</p>