English

$K_4$-free character graphs with diameter three

Group Theory 2020-06-30 v1 Combinatorics

Abstract

Let GG be a finite group and let Irr(G)\rm{Irr}(G) be the set of all irreducible complex characters of GG. Let cd(G)\rm{cd}(G) be the set of all character degrees of GG and denote by ρ(G)\rho(G) the set of primes which divide some character degrees in cd(G)\rm{cd}(G). The character graph Δ(G)\Delta(G) associated to GG is a graph whose vertex set is ρ(G)\rho(G) and there is an edge between two distinct primes pp and qq if and only if the product pqpq divides some character degree of GG. Suppose the character graph Δ(G)\Delta(G) is K4K_4-free with diameter 33. In this paper, we show that ρ(G)5|\rho(G)|\neq 5, if and only if GJ1×AG\cong J_1 \times A, where J1J_1 is the first Janko's sporadic simple group and AA is abelian.

Keywords

Cite

@article{arxiv.2006.15249,
  title  = {$K_4$-free character graphs with diameter three},
  author = {Mahdi Ebrahimi},
  journal= {arXiv preprint arXiv:2006.15249},
  year   = {2020}
}
R2 v1 2026-06-23T16:39:47.462Z