4-Regular prime graphs of nonsolvable groups
Donnie Munyao Kasyoki, Paul Odhiambo Oleche

TL;DR
This paper characterizes which simple 4-regular graphs can serve as prime graphs of finite nonsolvable groups based on their character degree sets.
Contribution
It identifies the specific simple 4-regular graphs that can be realized as prime graphs of finite nonsolvable groups.
Findings
Characterization of 4-regular prime graphs for nonsolvable groups
Identification of possible simple 4-regular graphs as prime graphs
Contribution to understanding the structure of character degree sets in group theory
Abstract
Let be a finite group and denote the character degree set for . The prime graph is a simple graph whose vertex set consists of prime divisors of elements in , denoted . Two primes are adjacent in if and only if for some . We determine which simple 4-regular graphs occur as prime graphs for some finite nonsolvable group.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · graph theory and CDMA systems
4-Regular prime graphs of nonsolvable groups
Donnie Munyao Kasyoki, Paul Odhiambo Oleche
Department of pure and applied mathematics
Maseno University
Abstract: Let be a finite group and denote the character degree set for . The prime graph is a simple graph whose vertex set consists of prime divisors of elements in , denoted . Two primes are adjacent in if and only if for some . We determine which simple 4-regular graphs occur as prime graphs for some finite nonsolvable group.
AMS subject classification: 20C15
Keywords: character degree, nonsolvable group, simple group
1 Introduction
The graphs arising from character degrees of finite groups have been studied extensively over the last few years. It was determined that the prime graphs of any finite group have diameter not exceeding 3 (see [18, 11, 12]). In [29], D. White summarised the graph structure for the prime graphs of finite simple groups. These were classified on the basis of classification of finite simple groups. In that we are able to determine that most simple groups have a complete prime graph.
In [26], H. P. Tong-Viet studied the 3-regular simple graphs that occur as prime graphs for some finite group. He proved that the complete cubic graph is the only 3-regular graph that occurs as a prime graph of some finite group . C. P. M. Zuccari [32] obtained that the only noncomplete regular prime graphs for finite solvable groups with vertices can only be the -regular, when is even. In particular, When is odd then no regular noncomplete graph occurs as a prime graph for some finite solvable group. However, the case for the regular graphs for nonsolvable groups has not been determined yet. In this paper, we seek to prove the following:
Let be a simple graph and let be two vertices of . We write if is adjacent to in . All simple groups considered are nonabelian.
Theorem 1.1**.**
Let be a nonsolvable group and be a prime graph for . If is 4-regular, then is complete with 5 vertices.
2 Simple groups
and denoted the alternating and symmetric groups respectively.
Lemma 2.1**.**
[29]* Let be a simple group such that is connected. Then is complete except:*
** 2. 2.
** 3. 3.
** 4. 4.
, a power of prime and for some . 5. 5.
* is a power of prime and for some *
Lemma 2.2**.**
Let be a finite simple group such that is -regular. Then is complete or .
Proof.
If is disconnected, then by [26, Lemma 2.6] .
Thus we may assume that is connected. By ATLAS [3], cannot be one of the groups in (1) or (2).
If is one of the groups in (3), then by [31, Theorem 3.3], and the subgraph of induced by is complete and two is adjacent to precisely the primes in . There is no possibility of being regular since the primes in are complete in .
If is one of the groups in (4), It follows by [30, Theorem 3.2] that if , then and the subgraph induced by is complete and is adjacent to the primes dividing or . So again has complete vertices. If , by ATLAS [3], is not regular.
If is as in (5), then by [30, Theorem 3.4], and the subgraph induced by is complete and is adjacent to the primes dividing or . So again has complete vertices. ∎
Lemma 2.3**.**
Let be a nonabelian simple group with and a subgraph of the house or the butterfly. Then is isomorphic to graphs in Figure 2 and , or a power of an odd prime .
Proof.
Clearly is either a house, a butterfly or is obtained by deleting at least one edge. Also, we note that every subgraph of the house or the butterfly is -free. Suppose that is connected. By [3], if is as in Lemma 2.1 (1) or (2), then .
If is as in (3), then by [31, Theorem 3.4], . By [31, Theorem 3.3] we have that has a subgraph isomorphic to and a vertex connected to some but not all primes in .
Suppose that is as in (4) or (5). If or a power of a prime , then is a or contains a by [30, Theorem 3.2]. Thus is disconnected.
Now, assume that has two connected components. Then by [30, Theorem 3.1], a power of an odd prime . Then the two connected components are and . The component is complete if and only if or is a power of 2, otherwise is as part 2(b) of [30, Theorem 3.1]. In this case, is disconnected with 2 connected components. We consider any subgraph of the two graphs with five vertices and two connected components (of course must have an isolated vertex). By [30, Theorem 3.1], will have an isolated vertex and a four-vertex component with a complete vertex since 2 is a complete vertex in the subgraph with vertices . This is as in Figure 2(b). For example,
[TABLE]
Observe that is isomorphic to the graph in Figure 2(b).
Now we may suppose that has three connected components. Then , so that has three connected components with at least one isolated vertex. The remaining component(s) is (are) complete. The only possibilities are as in Figure 2(a) and (c). An example for graph (a) is when . By [3] we have that
[TABLE]
In this case we obtain the graph in Figure 2(a). ∎
The following results will be used throughout this paper.
Lemma 2.4**.**
[27, Lemma 4.2]* Let be a normal subgroup of a group such that , where is a nonabelian simple group. Let . Then either is divisible by two distinct in for some or extends to a and or .*
The following result will be referred to as the Gallagher’s Theorem.
Theorem 2.5**.**
[8, Corollary 6.17][Gallagher’s Theorem]* Let be a normal subgroup of a group and let be an irreducible character of . If is extendible to , then the character for are irreducible, distinct for distinct and are all of the irreducible constituents of .*
Theorem 2.6**.**
[8, Theorem 11.7]* Let be a group and . Let be invariant in . If the Schur multiplier of is trivial, then extends to .*
In [7], Huppert determined all the simple groups whose orders are divisible by four primes. The results were summarized in Table 2 and Table 3 of [7]. The groups that were not featured in the tables then will be one of the groups listed in the Lemma below:
Lemma 2.7**.**
Let be a finite nonabelian simple group with and , where is a group in [7, Table 2,3], then exactly one of the following occurs:
- (i)
* where * 2. (ii)
* for some prime such that is a Mersenne prime;* 3. (iii)
* for some prime such that *
Let be one of the groups in Lemma 2.7 above. Since the outer automorphism of ( a prime and an integer) is of order . With this in mind, we deduce that .
3 Nonsolvable groups
Lemma 3.1**.**
Let and be groups and . Suppose that spans a complete subgraph of . Then is a complete subgraph of . Moreover, contains at least complete vertices.
Proof.
Clearly spans a complete subgraph of . It suffices to show that is adjacent to every prime in . Since , we must have for , not necessarily distinct such that for each , all ’s in . Also, for each there is a such that , . Since , we must have that for each and each . In fact we can observe that the primes in are complete vertices of .
To see the second part, Let . We show that it is adjacent to every other prime in . Let for some , then for every .
∎
Lemma 3.2**.**
Let be a nonsolvable group and be 4-regular with more than 5 vertices. Then every nonsolvable chief factor of is simple.
Proof.
Suppose that contains a subgraph isomorphic to . Then since is 4-regular, we must have that is isomorphic to or is a disjoint union of ’s. This contradicts [26, Lemma 2.6]. We may assume that is -free. Let , where a nonabelian simple group, be a chief factor of and . Then contains a minimal subgroup isomorphic to . We show that . By a way of contradiction, assume that . Let be such that . Since has no nontrivial abelian normal subgroups we have that . By [13, Main Theorem] we have that is complete if hence . We must have that where .
Case 1:
Suppose that . It follows that . Then there exists such that . By Lemma 2.4, either extends to or is divisible by two distinct primes in for some . We consider the two cases separately:
Subcase 1: extends to
If this holds then all the primes in are adjacent to . Thus if , then will contain a , thus we must have that . Since , there is a prime . So we have that is adjacent to all primes in or is adjacent to two primes in . If the former occurs then the primes in will have degree . Assume that the latter occurs. Then is adjacent to two primes in . This two primes will have degree .
Subcase 2: adjacent to two primes in
If this occurs then is adjacent to two primes in , say which implies that forms a triangle. Since , there is another prime such that is adjacent to all primes in or is adjacent to two primes in . If the former occurs, then we have two primes with degree greater than or equal to 5. Thus we may assume that the latter occurs. In this case we must have that or else we can find a different prime in and obtain a contradiction. If , then we require that the neighbours of be different from those of . In this case we have a graph with 6 vertices and contains a . This graph cannot be 4-regular.
Case 2:
Define and observe that if , then . Using the arguments used above. Each prime in is either adjacent to all primes in or is adjacent to 2 primes in . Either way, we observe that there is at least one prime in with degree . The proof is now complete.
Suppose that such that and . Notice that . If is solvable then must span at least an edge, say . Let be such that . By Lemma 2.4 we have that extends to or is divisible by two distinct primes in . In either way we obtain a contradiction. So, we may assume that is nonsolvable. If spans at least an edge, then by previous argument we obtain a contradiction. Suppose that it doesn’t span an edge, it follows by [10, Theorem 4.1] that for some and abelian. This implies that since . Since 2 is an isolated vertex for , it implies either has 4 disconnected components, or spans at least an edge, contradicting our assumption. This final contradiction implies that .
∎
Lemma 3.3**.**
Let satisfy the hypothesis of Lemma 3.2, with . Let be the solvable radical for . If is a chief factor of , then is almost simple with socle .
Proof.
Let . Then is almost simple with socle . By Lemma 3.2, is simple nonabelian and thus . It suffices to show that . By a way of contradiction suppose that . Let be such that is a minimal normal subgroup of . Then we have that is a nonabelian simple group. Observe that and , Which implies that the primes in are complete vertices in the subgraph induced by . Observe that since , we must have that . Otherwise . We deduce that . Write .
Case 1:
Let . By the structure of the graphs in Figures 3-6, any five vertices chosen in any of the graphs contains at most 2 complete vertices. Then this forces . We observe that if , then . In this case we must have that , since otherwise we would have that contradicting the structure of the graphs in consideration.
If we suppose that and , then we must have that . By invoking Lemma 3.1, we observe that spans a subgraph with 3 complete vertices. This again contradicts the stucture of the graphs in consideration. Thus the only cases we need to consider are when both and have 3 vertices and so it suffices to assume that .
Assume first that is -free. By [2, Theorem B], . There are two 4-regular graphs of order 7 shown in Figure 3 and 4 and one with 6 vertices. Observe that for any 5 vertices chosen in Figure 3, 4 and 8, we have that , and respectively.
We need to find simple groups and with , and . By [7], the only simple groups whose orders are divisible by 3 primes only are
[TABLE]
Each of these groups have order divisible by both 2 and 3. This contradicts the fact that . If the we obtain that , a contradiction.
We may now assume that contains a . So . First suppose . We have only one 4-regular graph of order 8 with a as a subgraph. Consider Figure 5 below, any choice of 5 vertices will induce a subgraph with only one complete vertex. This implies that . Again if , we obtain a contradiction as above.
Lastly we consider the case when has 9 vertices. We have only two 4-regular graphs which contains at least one . The graphs are shown in Figure 6.
However, any subgraph of order 5 chosen from the graph in Figure 6(b) has only one complete vertex. This obtains a contradiction by previous arguments.
Now, consider the graph in Figure 6(a). We can choose a subgraph with 5 vertices and 2 complete vertices. We obtain a subgraph isomorphic to the graph in Figure 7.
We seek to obtain simple groups and such that is isomorphic to graph in Figure 7. Since , one of the simple groups has order divisible by 4 primes. We have shown that this cannot occur.
Case 2:
It follows that . Since , it will suffice to assume that and and . We may also assume that and so that we have that by [7, 25]. By Lemma 3.1, the subgraph induced by is a complete cubic graph no matter the choice of the number of primes in each of the two cases. Now, the 4-regular graphs with six and seven vertices are -free and thus there is nothing to prove. We may assume that .
If is the 4-regular graph in Figure 5, without loss of generality, let for some fixed , say . Let , then we must have for some . By Lemma 2.4, extends to (or ) or is divisible by two primes in for some . This implies that each is adjacent to at least 2 distinct primes in . This is not the case for the graph in Figure 5. A similar argument obtains a contradiction for the graphs in Figure 6(a) and (b).
Case 3:
By [7], is a simple group with and it follows by [3] that . Also and thus . The subgraph induced by is a triangle. Consider the graphs in Figures 3 - 6. Choose any two prime . We obtain by previous arguments that is adjacent to at least two primes in . This condition is not satisfied by all vertices in any of the graphs chosen apart from one with 6 vertices. Now suppose that is isomorphic to Figure 8. If we choose any triangle in the graph, we obtain that the remaining primes are all connected. Let . Then . Let be such that . By Lemma 2.4, we have that is divisible by two distinct primes in or extends to . Suppose that the former occurs, then we obtain a subgraph isomorphic to , a contradiction so we may assume that the latter occurs. In this case we obtain that contains a subgraph with 5 vertices and two complete vertices. This does not occur as a subgraph of Figure 8. We obtain the final contradiction and thus . ∎
Hypothesis 3.4**.**
Let be nonsolvable group whose prime graph is 4-regular with . Let be the solvable radical of such that is almost simple with socle a nonabelian simple group.
Lemma 3.5**.**
Let be groups so that . Let be such that . Then is connected to all primes in or is connected to either 2 or 19.
Proof.
Let be such that . Let be an irreducible constituent for . Let , and let be the Clifford correspondent lying between and . If , then extends to since the Schur multiplier of is trivial by [8, Theorem 11.7]. By Gallagher’s Theorem we have that for every . It follows that is connected to all the primes in . We may assume that . Then it follows that for some maximal subgroup of . It is easy to see that is a maximal subgroup of . According to the Atlas [3], the possibilities for are 266, 1045, 1463, 1540, 1596, 2926, and 4180. We have that . Observer that divides . Each of the possibility of contains a 2 or a 19 as a prime divisor. ∎
Lemma 3.6**.**
Assume Hypothesis 3.4. If , then does not exist.
Proof.
It suffices to show that . By [7, 3] we easily deduce that . Let . Suppose on the contrary that . It follows that . By Pálfy’s condition, we must have that spans atleast two edges, say , where . We can show that the two edges assumed are disjoint. It is easy to see that if are the edges, then or contains a by Lemma 2.4. It follows that there is a such that and . By Lemma 2.4, each pair and are contained in some nondisjoint ’s, a vertex of degree more than five, or contains subgraph isomorphic to Figure 4 in which case or . The first two conclusions cannot occur so we may assume that the latter occurs. In fact since should not have an edge, we must have that . Also since no other edge should arise, we must have that is disconnected with two components each with two vertices or two vertices and a triangle. The former case cannot occur due to a Theorem by Palfy which states that , where and are the number of vertices of the two components. So the latter occurs. Without loss of generality, assume that and . Let be such that . Then by Lemma 2.4, we must have that is divisible by a prime in for some or extends to a . Either way we observe that is adjacent to a prime in different from itself, a contradiction. ∎
Lemma 3.7**.**
Assume Hypothesis 3.4 and let . If the subgraph of on is a complete cubic, then does not exist.
Proof.
If has 7 vertices then does not contain a and thus there is nothing to prove in this case. Thus we may assume that . It follows that by [7, 3, 25], which implies that contains at least three primes. Since and is solvable, we may use Pálfy’s condition which provides that must span at least an edge, say . Let be such that . By Lemma 2.4 we must have that divides two distinct primes in for some or extends to and or . It follows immediately that the former must occur. This implies that forms a complete cubic for some . This implies that , a contradiction. ∎
For the case when , we will not consider simple groups whose prime graphs have three vertices [Lemma 3.6] or are complete with at least 4 vertices by Lemma 3.7.
Lemma 3.8**.**
Assume Hypothesis 3.4. Then when and when .
Proof.
By [3], we deduce that . We use the arguments in the proof of Lemma 3.5 above. Let . By [3], we observe that in ,
[TABLE]
The maximal subgoups of are divisible by either 2 and 3 or 11. It is not difficulty to see that every prime in is adjacent to either 2 and 3 or to 11. Therefore we can have at most one vertex neighboring 2 and 3 which will make since in . Also there can only be atmost two neighbours of 11 outside of . Thus there should be at most three vertices in .
Now let . Suppose that . Since and is simple, we must have that spans at least an edge. Let be such that . Suppose that be such that . By Lemma 2.4, is divisible by 2 disntinct primes of for some . This implies that is divisible by 4 distinct primes implying that contains at least eight vertices. Contradicts the previous paragraph. Thus .
Now Let . By [3], we observe that
[TABLE]
Let . Then by Lemma 3.5, each prime in is adjacent to either 2 or 19. Since , two cannot have any more neighbor and thus any prime in must be adjacent to 19. However, 19 can only have one more neighbour since . ∎
Lemma 3.9**.**
Assume Hypothesis 3.4. Let , a power of some prime number . Then does not exist.
Proof.
Assume that . Then it follows that and thus we have that with . Since , the set is nonempty. Let . Let be such that . Suppose that is -invariant. Since the Schur multiplier of is trivial, it follows that extends to by Theorem 2.6. This implies that in , a contradiction. Hence, . Thus is a subgroup of some maximal subgroup of . By [3], we obtain that is divisible by at least 3 primes in . Thus must contain a as a subgraph. This implies that . This contradicts Lemma 3.8.
Suppose that . Then we have that since otherwise by . By [3], we have that form a complete subgraph of . Implying that has at least eight vertices. Thus and by Pálfys condition, there is such that . Let be such that . By Lemma 2.4, extends to or is divisible by two distinct primes in . This would result to one of the primes in having degree at least 5, a contradiction. Let . Then again we have that . By Pálfys condition there is such that . Let be such that and let . Suppose that is not -invariant. Then divides for some maximal subgroup of . By [3], the possibilities of are . By Clifford’s correspondence theorem, divides some degree in . We must have that since otherwise we would have a . Now let be in and let be such that . Let be the stabilizer of in . Then we must have that since otherwise we have that either deg(5) or deg(13) is greater than or equal to 5. Also, does not extend to , and thus we may use the projective degrees as in [3]. In this case we have that . Since is in , we must have that in , a contradiction. Thus we must have that . If extends to we have that contains a as a subgraph. Thus we must have that does not extend to . Hence we use the projective degrees provided in [3], we have that . Since we have that form a complete cubic which implies that , a contradiction.
Let . Then and thus . By previous arguments, let for some and . By Lemma 2.4, is divisible by two distinct primes in for some . We now have that contains a complete cubic. This implies that , which implies that . By Pálfy’s condition, spans at least two edges. Thus it suffices to assume that there is different from such that . By previous arguments we obtain that at least one vertex in has degree at least 5, a contradiction. A similar argument applies to any where a power of a prime with such that does not span a complete cubic.
Suppose that and is not complete. Then or with a power of and or , respectively. In this case contains a subgraph isomorphic to Figure 7. This implies that and is isomorphic to Figure 6(a) and is contained in one of the complete cubic subgraphs while four primes of form the other complete subgraph. But then by using Lemma 2.4, we should have that two primes in form a complete subgraph with two primes in , this is not achieved, a contradiction. ∎
The following results or facts will be used to prove subsequent results.
Remark 3.10**.**
[1, Remark 2] Let where and . If is -invariant, then there are irreducible characters in such that their degrees are divisible by .
Lemma 3.11**.**
[19, Lemma 3.7]* Let be a group and let be such that for some prime and some positive integer . Let and be the stabilizer of in with . Suppose that or with . Then has nontrivial intersection with each of the three sets , and where . Moreover, at least one of the following holds:*
- (a)
There are degrees so that divides and divides . 2. (b)
* is isomorphic to one of or and both and divide degrees in .*
Lemma 3.12**.**
[19, Lemmas 3.2-3.7]* Assume Hypothesis 3.4. Let , . Let and . Then*
- (A)
* is divisible by all primes in two of the three sets , and .* 2. (B)
* is divisible by all primes in and some degree in is divisible by one of or .* 3. (C)
Lemma 3.11 applies. 4. (D)
* is divisible by all primes in , the integer , and either , and divide degrees in , or divides a degree in .*
Lemma 3.13**.**
Assume Hypothesis 3.4. Let where is a power of some prime . Then does not exist.
Proof.
By Lemma 3.6, we have that .
Case 1:
If , then by [30, Theorem 3.1] we have that with (in no particular order)
[TABLE]
In both cases we have that in . So it suffices to consider that case when . In this case we must have that with
[TABLE]
We claim that . Suppose that . By [28, Theorem A], we have that for all . But becomes five, a contradiction. Thus is nonempty. Let and let be such that . Suppose that is -invariant, then by Remark 3.10 we have that both form complete subgraphs of . In either case we obtain that , a contradiction. Thus we may assume that . In this case we have that divides the degrees of all members of . We must have that for some maximal subgroup of . This therefore implies that divides and thus divides the degrees of all irreducible characters in . By [6, Hauptsatz II.8.27], the indices of all maximal subgroups of is divisible by at least three distinct primes. In this case we obtain that some degree in has degree at least 5, a contradiction.
Case 2:
By [27, Theorem B], we have that contains a triangle. We claim that . Suppose on the contrary that contains a and an isolated vertex. In this case we have that . Also, we can see that if , then contains a . So we must have that . Now we must have that and by Pálfy’s condition, spans atleast an edge. Let be such that for some . Then by Lemma 2.4, we obtain that contains two ’s whose intersection is nonempty, a contradiction. So we may assume that . Suppose that and let . Again, we have that divides some degree of . This implies that would contain a subgraph isomophic to Figure 7. This implies that . Which implies that and suppose that in with . Let be such that . By Lemma 2.4, form a complete cubic for some primes . In this case we obtain that must contain two complete cubic subgraphs whose intersection is non-empty, a contradiction. Thus . Let be such that . Let be such that and . Suppose that is -invariant for some . Then it follows by Remark 3.10 that divide some degrees of irreducible charactes in . This implies that admits a subgraph isomorphic to Figure 7, which in turn implies that . In particular, is isomorphic to Figure 6(a). In this case we must have that and by Pálfy’s condition, we have that spans at least two edges. This inturn (by Lemma 2.4) implies that has two complete cubic subgraphs and are not contained in the same . It will suffice to let with and let be such that and . Then it is not hard to see that by Remark 3.10. We see that and are some subgroups of listed in [6, Hauptsatz II.8.27]. Observe that their indices in will be divisible by either or 2. It is then not hard to see that the two ’s intersection is non-empty or , a contradiction. It follows that both are not -invariant. Let be the stabilizer of the character in for each . We observe that is one of subgroups of listed in [6, Hauptsatz II.8.27]. Suppose that is the elementary abelian -group. Then we have that form a , a contradiction. Now suppose that is the cyclic group of order where . In this case we have that forms a complete subgraph. This obtains that , contradiction. Now suppose that with as above. Let . Then extends to by [8, Corollary 11.22]. Let be an extension of in . If is invariant, then extends to and thus by Gallagher’s Theorem. Otherwise and by Clifford’s theorem, we have that . This therefore implies that is a degree in . Since is a divisor of we must have that form a triangle. This would imply that , a contradiction. Suppose that .
claim: * and is the highest power of that divides *. In particular, we claim that is a Hall {2,3}-subgroup of . Suppose that . Then and thus 3 divides . Since divides some degree in , we have that or . If , then contains a as a subgraph, a contradiction. Also, since 3 divides , then we have that . In this case we also have that must contain a with vertices .
Suppose that extends to , then by Gallagher’s theorem, or divides some degree in , in which case we obtain that contains a as a subgraph. So we may suppose that does not extend to . By [8, Corollary 11.29], there is a which is divisible by either 2 or 3. This as well leads to admitting as a subgraph.
Suppose that is a semidirect product of an elementary abelian group of order with a cyclic group of order , where and . is a Frobenius group with Frobenius Kernel , an elementary abelian -group. This implies that 2 divides . If does not extend to , then the degrees in are divisible by . Thus we must have that form a tringle, in which case , contradiction. Thus we may assume that does not extend to . Let be the Sylow q-subgroup for some prime . Then is cyclic and so extends to . By [8, Corollary 11.31], we have extends to . By Gallagher’s theorem, and by Clifford’s theorem we must have . This implies that forms a complete , a contradiction.
Suppose that . We claim that . Suppose the contrary that . Then it implies that . In particular, or Suppose that , then since is solvable. Then it is easy to see that in this case. Also, contains only 3 primes and so in this case as well. Thus . Now, by the projective degrees in [3], we see that divides some degree in . This implies that forms a triangle in which case , a contradiction.
Finally, suppose that or . By Lemma 3.11, we must have that has nontrivial intersection with each of the three sets and and divides some degrees in or divides some degree in . In both cases will exceed 5.
Case 3: .
Subcase 1: and
We claim that . Suppose on the contrary that . It follows that both for each . This results into a . Thus we have that has at least eight vertices. This implies that contains not less than three primes. Thus we can find such that in . Let be such that . Then by Lemma 2.4, together with two primes in form a . So we have two ’s whose intersection in not empty, a contradiction. Now we have that . So that contains at least three primes and by Pálfy’s condition, there is such that . Let be such that and observe that by Lemma 2.4 form a complete subgraph for some primes . It follows immediately that and thus contains at least four primes and thus must contain atleast two edges. It suffices to assume that are distinct from and and . Letting . It is not hard to see that will be contained in a and the intersection of two ’s is nonempty or is contained in one of the ’s and so there will be a prime with , a contradiction.
Subcase 2:
We claim that . Suppose on the contrary that . It follows that both for each form complete triangles which results into . Since contains at least two primes, let . If we let be such that and , then whether and extend to or not, we obtain that and are both adjacent to 2 which implies that , a contradiction.
Since , we have that . Let be such that and let be such that . If is -invariant, then by Remark 3.10, we must have that divide some degrees in . This results into a subgraph with 5 vertices and 3 complete vertices. This does not occur as a subgraph of any graph in consideration, a contradiction. We must thus assume that is not -invariant. Again, we must have that is one of the subgroups discussed above. If is one of the abelian subgroups of , then is divisible by at least three primes of . This implies that contains a . So we must have that is nonabelian.
Let be a Frobenius group. We obtained that with divisible by all primes in . This also implies that will contain a , a contradiction.
Let or . This implies that . By previous argument we obtain that or divides some degrees in and hence some degree in . This will imply that contains a .
Suppose that . By the projective degrees in [3], we must have that divides some degree in , whether extends to or not. By arguments in [14, Proof of Theorem 3.3], we obtain that divide some degree in . This however implies that , a contradiction.
Finally, if or . By Lemma 3.11, we must have that is divisible by at least three primes in . In this case, we obtain that form a , a contradiction. ∎
Lemma 3.14**.**
Assume Hypothesis 3.4. Let be such that . Then does not exist.
Proof.
We consider cases when and differently.
Case 1:
We have that . Since and is solvable, we can use Pálfy’s condition and assume that there is a such that in . Let be such that . If is -invariant, then since the Schur multiplier of is trivial, we have that extends to . Therefore, by Gallagher’s Theorem, . In this case, we obtain and is at least 5, a contradiction. Thus we may assume that is not -invariant.
Let . Then is one of the Dickson’s list of subgroups of in [6, Hauptsatz II.8.27]. Suppose that is an elementary abelian 2-group, then we have that , which would result in a as a subgraph of . Now, suppose that is a cyclic group or a Frobenius group. Then by Lemma 3.12, is divisible by all primes in two of the sets , and . So we may assume that is divisible and in which . In this case we obtain that contains a and thus . This also implies that and hence must span at least 2 edges by Pálfy’s condition. Let be different from . and let be such that . Let . Then we must have that extends to , in which case we obtain that contains two ’s whose intersection is nonempty. We may thus assume that . Then by Lemma 3.12, we observe that in all the cases, we must have some prime in with at least degree 5.
Case 2:
By [7], we have that . In particular is a Merssene prime and is a product of powers of two primes and . By [3], we observe that and in . We have that .
**Claim: . **
To show this, suppose that and let such that . Let be, respectively, irreducible constituents of where . Then and . Let and be the stabilizers of and in respectively. Suppose that , Then we obtain , a contradiction.
Thus we may assume that . Since implies that contains a , we must have that by [14] and Lemma 3.12. We may assume that since otherwise . This makes and . Now, we consider . If then , a contradiction so we must have that and by Lemma 3.12, we have or as argued above. Either way we obtain for some , a contradiction.
Now we show that with this property does not exist. Since , then we need to show that does not contain a . Let be such that and let be such that and . Let be the stabilizers of in respectively. Then we observe that by Lemma 3.12, otherwise contains a or an impossible subgraph when one of is -invariant. In this case we obtain a subgraph isomorphic to Figure 10.
Figure 10 is a subgraph of both 4-regular graphs with 7 vertices. Consider Figure 3. Observe that the graph is vertex transitive so we need to consider only one possibility. We may suppose that, (in that order),
[TABLE]
Observe that . Let be such that . And let be the be such that . Since in , it is evident that . Let . Then extends to and by Gallagher’s theorem, we have that
[TABLE]
Observe that if , we have that in both cases. But then by we must have that which is not the case. Thus we may assume that . By Lemma 3.12, we have that with
[TABLE]
But do not share any of the above possible neighbors. ∎
Lemma 3.15**.**
*Assume Hypothesis 3.4. Let for some . Then if , then , and is not isomorphic to Figure 2(a). *
Proof.
By Lemma 3.6 and Lemma 3.14, we have Since , it follows that for some field automorphism of of order with . Let . It follows by [28, Theorem A] that is adjacent to every prime in . But we know that when , a contradiction. Thus . Now suppose that is isomorphic to Figure 2(a). Then it follows that together with forms a butterfly. Thus we must have that has either 7 or 9 vertices. Suppose that has seven vertices. Then we have that . Let and let be such that . Then cannot be -invariant since that would imply that extends to which implies that is adjacent to all the primes in , a contradiction. Let be the stabilizer of in . Then by Lemma 3.12, we must have that is divisible by three primes which implies that forms a complete cubic. This contradicts the fact that does not contain a . So we may assume that . In this case we have that which in turn implies that there is with . If we let be the degree affording the edge, then we see that cannot extend to . Thus we obtain that and by Lemma 3.12, form a , a contradiction. ∎
Lemma 3.16**.**
Assume Hypothesis 3.4. Let . Then does not exist.
Proof.
Case 1:
Let and let be such that . This case is easy to see that together with four primes in form a whether extends to or not, a contradiction.
Case 2:
By Lemma 3.15, we must have that . We have that . Now, observe that . Let be such that where . Let and . Since , cannot extend to so we may assume that . By Lemma 3.12, we have that and both contain three elements. This would imply that contains two ’s which intersect at vertex 2. This does not form a subgraph of any 4-regular graph with nine vertices.
Case 3:
In this case we have that by Lemma 3.15. This implies that and thus spans an edge. Let such that . Let be such that . Let and . Since , cannot extend to so we may assume that . Observe that . By Lemma 3.12, we have that and both contain two elements. In this case we obtain that must be isomorphic to Figure 6(a) since we obtain two ’s. Relabel Figure 6(a) as in the Figure below:
Where and . We observe that and . By previous arguments we obtain a contradiction since the pairs have no common neighbors.
Case 4:
First suppose that . Then by Lemma 3.15, is isomorphic to Figure 2(c). Let . Then it follows that is adjacent to every member of which obtains a . Now, observe that . Let and define in and as defined in the previous case. Let and , . Neither of extends to and so we must have since otherwise we would have a or two ’s whose intersection is nonempty. This will as well result in either or having degree at least 5, a contradiction. Thus we may assume that . Now we have that which implies that must span at least two edges. In this case we have that is one of the graphs in Figure 2(a) or (c). Both cases would result in a or two non-disjoint ’s, a contradiction.
Case 5:
Suppose that . Then must have two ’s. So it suffices to consider the case when is isomorphic to Figure 6(a). Considering Figure 11 above, we may consider an edge and obtain a contradiction as in Case 3 above. ∎
Lemma 3.17**.**
Assume Hypothesis 3.4. Let be isomorphic to Figure 5. Then and belong to different ’s.
Proof.
It suffices to show that the case holds for .
Case 1:
First we suppose that and let . Then we have that is adjacent to all primes in . Since is isomorphic to Figure 2(c), we have that form a where . This implies that is contained in the other . Now suppose that . Then and thus there is such that in . Let be such that . Since , we have that does not extend to . Let By Lemma 3.12, we must have that where . This implies that form a . This implies that belongs to the other of .
Case 2:
In this case we must have that and in that order. It suffices to consider the case when and . Let and let be such that . Then again we observe that does not extend to and thus . By Lemma 3.12, we must have that since otherwise we obtain a . Thus we have that forms a . This implies that is in the other . ∎
Remark 3.18**.**
In the case , with and as described in the proof of Lemma 3.17 above, we can show that this case does not occur. We have obtained that and are in different ’s. Moreover, in the proof, we observe that forms one of the ’s in . Which implies that the remaining vertex which is a prime in is in the same as . Let be the remaining vertex and let be such that . Let . Observe that cannot extend to and thus . By Lemma 3.12 we must have that . Either way will contain a .
Lemma 3.19**.**
Assume Hypothesis 3.4. Let be isomorphic to Figure 5. Then does not exist.
Proof.
Let and let . By Lemma 3.17, there is a and a in such that and that does not belong to any triangle in . Let be such that . Let be an irreducible constituent of . Since in , we must have that . We observe that . Let . Suppose that is not -invariant. Then we must have that is divisible by all primes in two of the sets . This will obtain that contains three primes, or contains 2. Since are chosen in such a way that none equals to 2, we obtain a contradiction. Thus we may assume that . Since the Schur multiplier of is trivial, we have that extends to . By Gallagher’s theorem, we have that
[TABLE]
We deduce that or in which case we obtain that . But and which implies that is connected to all the primes in both and , a contradiction.
∎
Lemma 3.20**.**
Assume Hypothesis 3.4. Let be 4-regular with 7 vertices. Then does not exist.
Proof.
By Lemmas 3.14, 3.13 and Lemma 3.9 we must have that and .
Case 1:
Suppose that Since does not contain a , we have that is two disconnected triangles and an isolated vertex. We choose two disconnected triangles in Figure 3. Label them and so that . The graph is vertex transitive and therefore whichever triangles we pick we obtain the same conditions. Observe that and this is not the case in whether or not. In fact if then we obtain that . So we may assume that . Let be such that and let be such that . We observe that is nontrivial. Suppose that , then we have that is extendible to a . In this case we obtain that
[TABLE]
In whichever case we obtain that . It is easy to observe from the degrees in that this case cannot occur. Therefore we we must have that . By Lemma 3.11 and Lemma 3.12, we have that is divisible by at least three primes. A case which would result into a as a subgraph. Whichever two triangles we choose in Figure 4, we obtain the same conclusion.
Case 2:
In this case we obtain that is diconnected with one triangle, a path with two vertices and an isolated vertex. Let and let be such that . Let . Then it follows that , since otherwise extends to and . Now, by Lemma 3.11 and Lemma 3.12, we obtain that contains a , a contradiction.
Now we may suppose that and . We skipped the case when since it will obtain a . So now we have . By [28, Theorem A], we have that . Since both and are adjacent to all the four primes in , we obtain that , a contradiction.
Case 3:
By Lemma 3.15, we have that is not isomorphic to Figure 2(a). Suppose that is isomorphic to Figure 2(c), then by [28, Theorem A] we have that contains a , a contradiction.
Case 4:
If is isomorphic to Figure 2(c). Let we may assume that since otherwise we obtain a , contradiction. Let be such that and . We must obtain that and are both divisible by only two primes where , . Othewise would contains a . In Figure 4, choose any two nonadjacent vertices and label them and . There is only way to choose them so that the remaining vertices span a triangle. Let and let . We must have that . Observe that in . Let be such that and let be such that . Then . Suppose that extends to , then we must have that
[TABLE]
We observe that . This implies that , a contradiction. So we may suppose that . By Lemmas 3.11 and 3.12, we may assume that is divisible by two primes which implies that and thus form a .
Suppose that is isomorphic to Figure 3 and choose vertices and such that they do not span an edge such that the remaining vertices span a triangle. The graph is vertex transitive so we choose only one combination. Let and , we are left with . By previous argument we obtain a contradiction.
Now, we may suppose that is isomorphic to Figure 2(a). We may assume that . Let . Then we must have that and do not span an edge. Let be such that and . Let and . Suppose that , then we have that is extendible to an irreducible character . This inplies that is adjacent to all the primes in by Gallagher’s Theorem. This however means that , a contradiction. Thus we may assume that . By Lemmas 3.11 and 3.12, we have that contains a , a contradiction. ∎
Lemma 3.21**.**
[19, Lemma 3.1]* Lemma 3.1. Let be groups with for some prime-power . Suppose the character is -invariant but does not extend to . Then, is odd and one of the following holds:*
- (i)
* where ,* 2. (ii)
* and .*
Hypothesis 3.22**.**
is a nonsovable group whose prime graph is 4-regular with 6 vertices. Let be the solvable radical. is almost simple with socle a nonabelian simple group.
Lemma 3.23**.**
Assume Hypothesis 3.22. Let , and . Then does not exist.
Proof.
It follows by [10] that is connected or disconnected with two connected components. Suppose that is disconnected with two connected components. Then where is a power of an odd prime . It follows that . contains a triangle if and only if , for some . Otherwise contains a path and an isolated vertex. By choice of any subgraph of isomorphic to we obtain that contains two adjacent vertices, say . Let be such that . Let be an irreducible constituent of . Then we have that . Since , we see that . By Lemma 2.4 is divisible by two distinct primes in for some where or is extendible to in which case or . The former implies that must contain a , a contradiction. The latter does not occur. Now suppose that , then by [7, 3], we must have that and contains as a subgraph a square with one diagonal or a in the case where contains a triangle [28, Theorem A]. We may assume that the former occurs and in this case we must have that . Let and let be such that . Let . By Lemma 3.12 we have that is divisible by at least three primes or case (D) occurs. In this case it suffices to assume that . By conclusion of case (D) we obtain that form a or and all form triangles. Which obtains a graph which is not a subgraph of Figure 8. So we may suppose that . By Gallagher’s Theorem we obtain that is adjacent to all the primes in or to all primes in but by Lemma 3.21. Suppose that and . we obtain that and in . Let be such that and . Since and in , we have that . Let be such that and . Let and . Suppose that . Then we must have that
[TABLE]
or
[TABLE]
where . In both cases we obtain that is adjacent to all primes in . Similarly is also adjacent to all primes in . This cannot occur. So we may assume that . By Lemma 3.12, we have that is divisible by atleast three primes of . So we obtain that is contained in some triangle with two other primes in . This obtains that the degree of one of the primes in is 5, a contradiction.
Suppose that is connected, then by [7, 3, 29], we must have that
[TABLE]
It follows by [3], is always equal to except the case in which case we must have since otherwise would have a . Now, by structure of we will obtain that contains two adjacent vertices. By Lemma 2.4, we obtain a contradiction.
∎
Lemma 3.24**.**
Assume Hypothesis 3.22. Let . Then does not exist.
Proof.
Case 1: with
In this case, it suffices to consider the case when by Lemma 3.23. It follows that is disconnected with two isolated vertices, say and a path with two vertices, say and that contains two primes, say . We may assume that since otherwise by Lemma 2.4, we must have that contains a , a contradiction. Let be such that and . Let and . Suppose that . Then we have that and both extend to by Theorem 2.6. By Gallagher’s Theorem we obtain that
[TABLE]
This obtains a graph isomorphic to Figure 12(a).
We observe that in the subgraph above but in so we let be such that and let be such that . Then we must have that since in . Suppose that is -invariant. Then it follows that extends to , in which case we have
[TABLE]
In this case we must have that . By the fact that , we have that and are edges and thus , a contradiction. Thus we may assume that is not -invariant. In this case we have by Lemma 3.12 that is divisible by 2 and or there is a degree in divisible by three primes in , a contradiction. However, if the former occurs then we obtain that is a triangle implying , a contradiction. Now we may suppose that one of is properly contained in . Without loss of generality, let . Then by Lemma 3.12, we have that is divisible by only two primes and , or we obtain a . But by assumption we must have that and . This will not occur so now we may let such that . Let be such that . Then we have that is nontrivial. Suppose that . Then we have that
[TABLE]
Either way we obtain that . This however obtains triangles , , a contradiction. Thus we must have that . We may thus use Lemma 3.12 to obtain that contains a , a contradiction.
Case 2:
Suppose that and with . Assume further that does not contain a triangle. Then is isomorphic to Figure 2(a). Let . Let be such that . Let . If , then we have that extends to and hence obtain that is adjacent to all primes in . This implies that , a contradiction. Now, suppose that . By Lemma 3.12 and Lemma 3.11, we have that is divisible by at least three primes in or case (D) occurs. In all the cases we obtain a , a contradiction.
Now assume that is isomorphic to Figure 2(c). and let and be as defined. Suppose that . Then again by Lemma 3.12, we must have that is divisible by only two primes 2 and (This conclusion is obtained due to the fact that the Frobenius group is of order and if is composite, then we will have that divides some degree in by Ito-Michler’s Theorem). By [6, Hauptsatz II.8.27] we have that is a Frobenius group, a cyclic group of order or a dihedral group of order . But is connected to two more primes in . This will imply that the two more vertices adjacent to are in and are indeed connected in . Let be the two primes in adjacent to and let be such that and . Let and . Suppose that , Then by Gallagher’s theorem we have that is adjacent to all the primes in implying that . So we must have . By Lemma 3.12, we have that forms a or is adjacent to all primes in obtaining a , a contradiction.
Now suppose that and . By [7, 25], we obtain that if , then and are the only cliques in . This means that 2 is still an isolated vertex. Let and let be such that . Suppose that , then we obtain a subgraph isomorphic to Figure 12(a) and following the arguments on case 1 we obtain a contradiction. Thus we must have that . In this case we must have that satisfies case (A) and thus we must have that obtaining a subgraph isomorphic to Figure 12(b). Like in case 1 we see that and as argued we obtain a contradiction.
Suppose that a power of an odd prime and . We must have that is disconnected with two connected components one of which is an isolated vertex and the other is a 4-vertex graph with one triangle. This case we must have that . Let and let . Let . We must have that extends to and is adjacent to every prime of or the hypothesis of Lemma 3.21 is satisfied. If the former occurs, we obtain a contradiction since . If the latter occurs, then by Lemma 3.21, . Since one of is a triangle, we obtain a , a contradiction. So we may assume that . By Lemma 3.12 we must have that is divisible by at least three primes, or case (D) occurs. In both cases, we obtain a , a contradiction. The case when and has been handled in Lemma 3.23.
Case 3:
In this case we must have that or a power of a prime . Suppose that . Observe that by [3]. Observe that in but in . Let be such that . Let be an irreducible constituent of . We observe that . Let . Suppose that . Since the Schur multiplier of is trivial, it follows that extends to in . Thus we have
[TABLE]
In whichever case we obtain that . In this case we obtain that both 5 and 11 are adjacent to all other primes in . Thus we must have that . This implies that is contained in one of the maximal subgroups of . We obtain that is divisible in all cases except when a nonabelian group. We may suppose that in this case. Since it is nonabelian, then there is a degree in divisble by either or . In either case we obtain that there is a degree in divisible by , . This is not however possible since we obtain a .
Now suppose that for an odd prime . Then is disconnected with two connected component. Since does not have a , it follows that . We also see that is a power of 2 since otherwise, we would obtain that the connected component of with 5 vertices contains at least two complete vertices. Which is not possible in construction of . Thus we may assume that is isomorphic to . Let be such that for some . Let be an irreducible constituent of . Since in , it follows that . Let be the stabilizer of in . Suppose that . By Lemma 3.12, we have that is divisible by all primes in two of the sets . In either case we obtain that is divisible by at least 3 primes in which case we obtain a , a contradiction thus we must have that . If is extendible to some in , then we have that
[TABLE]
where .
If or any other we obtain that or . Since and we must have that or is connected to all primes in which would imply that or contains a , a contradiction. Thus is does not extend to . By Lemma 3.21
[TABLE]
A similar argument obtains a contradiction.
We now suppose that . Then we have that . Let . Then we must have that contains a triangle. Let and , . Observe that if , then . Otherwise, we obtain that will contain a . Also observe that since by [28]. So we note that has an isolated vertex 2. Then in the construction of , we should not that 2 is adjacent to all but one prime in the set . Let be such that . Let be such that , and let be the irreducible constituent of . It is not hard to note that . Let . Then is extendible to an irreducible character of . Hence we must have
[TABLE]
If or , we have that . If we choose such that with , then by and we obtain that , a contradiction. We may thus suppose that . By Lemma 3.12 we obtain that is divisible by at least 3 primes with 2 among them. This however results into a , since we chose to belong to the triangle in , a contradiction.
Now we may suppose that . Let . Then by [28, Theorem A], we see that cannot contain a triangle and thus should be isomorphic to Figure 2(1). This implies that has two connected components (a butterfly and an isolated vertex). Again if we let be such that for some and . Let be an irreducible constituent of . Observe that . Let . By previous argument we obtain that are adjacent to all primes in which implies that contains a . So we may assume that . In this case we obtain that is divisible by all primes in two of the sets which implies that contains a , a contradiction.
∎
Lemma 3.25**.**
Assume Hypothesis 3.22. Let , then does not exist.
Proof.
By [7, 3], we have that . By any choice of three vertices in Figure 8, we have that the remaining vertices span an edge. Let be such that . Let be such that . Then by Lemma 2.4, is extendible to or is divisible by two distinct primes in . If is extendible to , then are adjacent to all the primes in . The subgraph obtained is not an induced subgraph of Figure 8. If is divisible by two distinct primes in , then we obtain a . ∎
Lemma 3.26**.**
Let be a finite nonsolvable group with a 4-regular prime graph with more than 9 vertices. Then does not exist.
Proof.
Since is 4-regular, then it is clear that it is -free. The proof follows from [1, Theorem A]. ∎
Proof of Theorem 1.1.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Z. Akhlaghi, K. Khedri and B. Taeri, Finite groups with K 5 subscript 𝐾 5 K_{5} -free prime graphs. Preprint.
- 2[2] Z. Akhlaghi and H. P. Tong-Viet, Finite groups with K 4 subscript 𝐾 4 K_{4} -free prime graphs, Algebras and Representation Theory, 397 (2014), 18-31.
- 3[3] J. H. Conway, R. T. Curtis, S. P. Norton, R. A. Parker, and R. A. Wilson, Atlas of Finite Groups: Maximal Subgroups and Ordinary Characters for Simple Groups , Clarendon Press, Oxford, England, 1985.
- 4[4] M. Bianchi, D. Chillag, M. Lewis, E. Pacifici, Character degree graphs that are complete graphs, Proceedings of the AMS , 135 (2007), no. 3, 671-676.
- 5[5] R. Guralnick, Subgroups of prime power index in a simple group, J. Algebra, 81 (1983), 304-311. http://dx.doi.org/10.1016/0021-8693(83)90190-4 . · doi ↗
- 6[6] B. Huppert, Endliche Gruppen I , Springer-Verlag, Berlin, 1983.
- 7[7] B. Huppert and W. Lempken, Simple groups of order divisible by at most four primes, Proc. of the F. Scorina Gomel State Univ. 16 (2000), no. 3, 64-75.
- 8[8] I. M. Isaacs, Character Theory of Finite Groups, AMS Chelsea, 2006.
