The prime graph on class sizes of a finite group has a bipartite complement
From MaRDI portal
Publication:2333341
DOI10.1016/j.jalgebra.2019.09.022zbMath1443.20055OpenAlexW2979391115WikidataQ127066074 ScholiaQ127066074MaRDI QIDQ2333341
Lucia Sanus, Silvio Dolfi, Víctor Sotomayor, Emanuele Pacifici
Publication date: 12 November 2019
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgebra.2019.09.022
Conjugacy classes for groups (20E45) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items (2)
Groups whose prime graph on class sizes has a cut vertex ⋮ The prime graphs of some classes of finite groups
Cites Work
- Incomplete vertices in the prime graph on conjugacy class sizes of finite groups.
- A characterization of the prime graphs of solvable groups.
- Groups whose character degree graph has diameter three
- On the character degree graph of solvable groups. I: Three primes
- Bounding the number of vertices in the degree graph of a finite group
- On the character degree graph of finite groups
- On independent sets in the class graph of a finite group.
- Products of primes in conjugacy class sizes and irreducible character degrees.
- THE INFLUENCE OF CONJUGACY CLASS SIZES ON THE STRUCTURE OF FINITE GROUPS: A SURVEY
- On the character degree graph of solvable groups
This page was built for publication: The prime graph on class sizes of a finite group has a bipartite complement