Classifying Families of Character Degree Graphs of Solvable Groups
Abstract
We investigate prime character degree graphs of solvable groups. In particular, we consider a family of graphs k,t constructed by adjoining edges between two complete graphs in a one-to-one fashion. In this paper we determine completely which graphs k,t occur as the prime character degree graph of a solvable group.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.