On divisibility graph for simple Zassenhaus groups
Abstract
The divisibility graph D(G) for a finite group G is a graph with vertex set cs~(G)\1\ where cs~(G) is the set of conjugacy class sizes of G. Two vertices a and b are adjacent whenever a divides b or b divides a. In this paper we will find D(G) where G is a simple Zassenhaus 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.