Papers
Topics
Authors
Recent
Search
2000 character limit reached

$K_4$-free character graphs with diameter three

Published 27 Jun 2020 in math.GR and math.CO | (2006.15249v1)

Abstract: Let $G$ be a finite group and let $\rm{Irr}(G)$ be the set of all irreducible complex characters of $G$. Let $\rm{cd}(G)$ be the set of all character degrees of $G$ and denote by $\rho(G)$ the set of primes which divide some character degrees in $\rm{cd}(G)$. The character graph $\Delta(G)$ associated to $G$ is a graph whose vertex set is $\rho(G)$ and there is an edge between two distinct primes $p$ and $q$ if and only if the product $pq$ divides some character degree of $G$. Suppose the character graph $\Delta(G)$ is $K_4$-free with diameter $3$. In this paper, we show that $|\rho(G)|\neq 5$, if and only if $G\cong J_1 \times A$, where $J_1$ is the first Janko's sporadic simple group and $A$ is abelian.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.