Bounding the number of vertices in the degree graph of a finite group

DOI10.1016/J.JPAA.2019.06.006OpenAlexW2962937261WikidataQ127712963 ScholiaQ127712963MaRDI QIDQ2318411

Lucia Sanus, Silvio Dolfi, Emanuele Pacifici, Zeinab Akhlaghi

Publication date: 15 August 2019

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.01674

Mathematics Subject Classification ID

Ordinary representations and characters (20C15)

Related Items (9)

n-Exact character graphs ⋮ Methods and questions in character degrees of finite groups ⋮ 5-regular prime graphs of finite nonsolvable groups ⋮ Disconnected character graphs and odd dominating sets ⋮ Planar character-graphs ⋮ On Huppert's rho-sigma conjecture ⋮ ON THE REGULARITY OF CHARACTER DEGREE GRAPHS ⋮ On the character degree graph of finite groups ⋮ The prime graph on class sizes of a finite group has a bipartite complement

Cites Work

• Unnamed Item
• Groups whose prime graphs have no triangles.
• An overview of graphs associated with character degrees and conjugacy class sizes in finite groups.
• On the character degree graph of finite groups
• Finite groups with \(K_4\)-free prime graphs.
• Character degrees of extensions of PSL2(q) and SL2(q)
• On the character degree graph of solvable groups
• Prime divisors of character degrees
• Finite groups with K₅-free prime graphs

This page was built for publication: Bounding the number of vertices in the degree graph of a finite group