On prime character degree graphs occurring within a family of graphs (iii)
classification
🧮 math.GR
keywords
graphscharacterdegreeprimeclassificationconcludeconstructiondetermine
read the original abstract
We conclude the classification work done in the two previous papers of the same name. Here we add flexibility to the construction, thereby viewing the graphs in full generality. Our goal, as ever, is to determine which graphs do or do not occur as the prime character degree graph of a solvable group.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.