×

Finite nonsolvable groups whose character graphs have no triangles. (English) Zbl 1207.20005

It is shown that the alternating group \(A_5\) is the only nonsolvable group whose character graph has no triangles.
Here the character graph of a finite group \(G\) is defined as follows. The vertices of that graph are the nonlinear complex irreducible characters of \(G\), there is an edge between two vertices \(\chi\) and \(\psi\) if and only if \(\chi(1)\) and \(\psi(1)\) admit a common prime divisor. The authors mention that, due to O. Manz, R. Staszewski and W. Willems [Proc. Am. Math. Soc. 103, No. 1, 31-37 (1988; Zbl 0645.20005)], the number of components of the character graph of any group is at most 3 and that it is at most 2 for any solvable group. Recently, due to Y.-T. Wu and P. Zhang [J. Algebra 308, No. 2, 536-544 (2007; Zbl 1118.20012)], a characterization of those finite solvable groups has been obtained whose character graphs have no triangles. Namely this happens precisely when the solvable group \(G\) is not isomorphic to \(S_4\) or if \(\#(\text{Irr}(G)\setminus\text{LIrr}(G))\leq 2\). Thus, by means of the paper under review and by the papers mentioned before, the classification of those finite groups whose character graphs have no triangles, is complete.

MSC:

20C15 Ordinary representations and characters
05C25 Graphs and abstract algebra (groups, rings, fields, etc.)
20D60 Arithmetic and combinatorial problems involving abstract finite groups
20D05 Finite simple groups and their classification

Software:

CHEVIE
Full Text: DOI

References:

[1] Bertram, E. A.; Herzog, M.; Mann, A., On a graph related to conjugacy classes of groups, Bull. Lond. Math. Soc., 22, 6, 569-575 (1990) · Zbl 0743.20017
[2] Carter, R. W., Finite Groups of Lie Type: Conjugacy Classes and Complex Characters (1985), Wiley: Wiley New York · Zbl 0567.20023
[3] Conway, J. H.; Curtis, R. T.; Norton, S. P.; Parker, R. A.; Wilson, R. A., Atlas of Finite Groups (1984), Oxford University Press: Oxford University Press London · Zbl 0568.20001
[4] Chillag, D.; Herzog, M.; Mann, A., On the diameter of a graph related to conjugacy classes of groups, Bull. Lond. Math. Soc., 25, 3, 255-262 (1993) · Zbl 0810.20018
[5] Dornhoff, L., Group Representation Theory, Part A: Ordinary Representation Theory (1971), Marcel Dekker: Marcel Dekker New York · Zbl 0227.20002
[6] Enomoto, H., The characters of the finite symplectic group \(Sp(4, q), q = 2^f\), Osaka J. Math., 9, 1, 75-94 (1972) · Zbl 0254.20005
[7] Feit, W.; Thompson, J. G., Solvability of groups of odd order, Pacific J. Math., 13, 3, 775-1029 (1963) · Zbl 0124.26402
[8] Fang, M.; Zhang, P., Finite groups with graphs containing no triangles, J. Algebra, 264, 2, 613-619 (2003) · Zbl 1024.20021
[9] Geck, M.; Hiss, G.; Lübeck, F.; Malle, G.; Pfeiffer, G., CHEVIE—A system for computing and processing generic character table, Appl. Algebra Engrg. Comm. Comput., 7, 175-210 (1996) · Zbl 0847.20006
[10] Isaacs, I. M., Character Theory of Finite Groups (1994), Dover: Dover New York · Zbl 0823.20005
[11] Ito, N., On the degrees of irreducible representations of a finite group, Nagoya Math. J., 3, 5-6 (1951) · Zbl 0043.26002
[12] James, G.; Kerber, A., The Representation Theory of the Symmetric Groups (1981), Addison-Wesley Publishing Company · Zbl 0491.20010
[13] Lewis, M. L., Derived length and character degrees, Proc. Amer. Math. Soc., 126, 7, 1915-1921 (1998) · Zbl 0915.20002
[14] Lewis, M. L., An overview of graphs associated with character degrees and conjugacy class sizes in finite groups, Rocky Mountain J. Math., 38, 1, 175-211 (2008) · Zbl 1166.20006
[15] Lu, Ziqun; Zhang, Jiping, On the diameter of a graph related to \(p\)-regular conjugacy classes of finite groups, J. Algebra, 231, 2, 705-712 (2000) · Zbl 0964.20009
[16] Michler, G. O., Brauer’s conjectures and the classification of finite simple groups, (Representation Theory II, Groups and Orders. Representation Theory II, Groups and Orders, Lecture Notes in Math. (1986), Springer: Springer Heidelberg), 129-142 · Zbl 0628.20013
[17] Malle, G.; Moretó, A., Nonsolvable groups with few character degrees, J. Algebra, 294, 1, 117-126 (2005) · Zbl 1098.20007
[18] Moretó, A.; Qian, G. H.; Shi, W. J., Finite groups whose conjugacy class graphs have few vertices, Arch. Math., 85, 2, 101-107 (2005) · Zbl 1104.20027
[19] Manz, O.; Staszewski, R.; Willems, W., On the number of components of a graph related to character degrees, Proc. Amer. Math. Soc., 103, 1, 31-37 (1988) · Zbl 0645.20005
[20] Manz, O.; Willems, W.; Wolf, T. T., The diameter of the character degree graph, J. Reine Angew. Math., 402, 181-198 (1989) · Zbl 0678.20002
[21] Srinivasan, B., The characters of the finite symplectic group \(Sp(4, q)\), Trans. Amer. Math. Soc., 131, 488-525 (1968) · Zbl 0213.30401
[22] Simpson, W. A.; Frame, J. S., The character tables for \(SL(3, q), SU(3, q^2), PSL(3, q), PSU(3, q^2)\), Canad. J. Math., 25, 3, 486-494 (1973) · Zbl 0264.20010
[23] Steinberg, R., The representations of \(GL(3, q), GL(4, q), PGL(3, q)\) and \(PGL(4, q)\), Canad. J. Math., 3, 225-235 (1951) · Zbl 0042.25602
[24] White, Donald L., Degree graphs of simple linear and unitary groups, Comm. Algebra, 34, 8, 2907-2921 (2006) · Zbl 1105.20007
[25] White, Donald L., Degree graphs of simple orthogonal and symplectic groups, J. Algebra, 319, 2, 833-845 (2008) · Zbl 1145.20007
[26] White, Donald L., Degree graphs of simple groups, Rocky Mountain J. Math., 39, 5, 1713-1739 (2009) · Zbl 1180.20008
[27] Wu, Yi-Tao; Zhang, Pu, Finite solvable groups whose character graphs are trees, J. Algebra, 308, 2, 536-544 (2007) · Zbl 1118.20012
[28] Zhang, J. P., A note on character degrees of finite solvable groups, Comm. Algebra, 28, 9, 4249-4258 (2000) · Zbl 0980.20005
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.