A completeness criterion for the common divisor graph on p-regular class sizes

Abstract

Let G be a finite group. For some fixed prime p, let p(G) be the common divisor graph built on the set of sizes of p-regular conjugacy classes of G: this is the simple undirected graph whose vertices are the class sizes of those non-central elements of G such that p does not divide their order, and two distinct vertices are adjacent if and only if they are not coprime. In this note we prove that if p(G) is a k-regular graph with k≥ 1, then it is a complete graph with k+1 vertices.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…