pith. sign in

arxiv: 1906.08515 · v1 · pith:EBZBITWYnew · submitted 2019-06-20 · 🧮 math.GR · math.CO

An overview on the bipartite divisor graph for the set of irreducible character degrees

Roghayeh Hafezieh , Pablo Spiga This is my paper

Pith reviewed 2026-05-25 19:18 UTC · model grok-4.3

classification 🧮 math.GR math.CO
keywords bipartite divisor graphirreducible character degreesprime graphdivisor graphfinite groupscharacter theory
0
0 comments X

The pith

A bipartite graph with primes and character degrees encodes both the prime graph and the divisor graph.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper defines the bipartite divisor graph on the irreducible character degrees of a finite group, with one part consisting of all primes that divide at least one degree and the other part consisting of the non-identity degrees themselves. An edge exists precisely when a prime divides a degree. This single graph is shown to contain all the adjacency information of both the prime graph and the divisor graph on the same set of degrees. The authors collect and organize the known theorems about the new graph, strengthen a few earlier statements, and record several open questions that arise from the unified viewpoint.

Core claim

The bipartite divisor graph for the set of irreducible complex character degrees of a finite group G has as its vertex set the prime numbers dividing some character degree together with the non-identity character degrees, and declares a prime p adjacent to a degree m if and only if p divides m. This graph is bipartite by construction and encodes the prime graph and the divisor graph on the set of irreducible character degrees.

What carries the argument

The bipartite divisor graph on character degrees, which records divisibility between primes and degrees in a single bipartition.

If this is right

  • Theorems proved for the prime graph translate immediately into statements about the divisor graph and vice versa.
  • Connectivity or diameter questions for either of the two classical graphs become questions about the single bipartite object.
  • Classification results that rely on the prime graph or the divisor graph now apply uniformly through the common encoding.
  • Open problems stated for one graph are equivalent to open problems for the other via the shared structure.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same encoding technique could be applied to other numerical sets attached to groups, such as conjugacy class sizes, to produce parallel unified graphs.
  • Computational enumeration of the bipartite divisor graph for all groups of small order would give an exhaustive check of the encoding property in those cases.

Load-bearing premise

The literature results that the paper summarizes and improves are stated accurately.

What would settle it

A finite group whose prime graph or divisor graph on character degrees cannot be recovered from the bipartite divisor graph would refute the encoding claim.

Figures

Figures reproduced from arXiv: 1906.08515 by Pablo Spiga, Roghayeh Hafezieh.

Figure 1
Figure 1. Figure 1: Examples of two bipartite divisor graphs B(X) giving rise to ∆(X) ∼= Γ(X) ∼= K3 taking, for instance, X = {pq, pr, qr} or X = {pqr, p, p2}. (There are other isomorphism classes of B(X) yielding ∆(X) ∼= Γ(X) ∼= K3, here we just presented two.) It goes without saying that the extra information brought by B(X) asks for a finer investigation. The first application of the bipartite divisor graph in group theory… view at source ↗
Figure 3
Figure 3. Figure 3: As in Example 2.12, this example was constructed (with some luck) with the help of a computer after deducing some preliminary theoretical properties. Example 2.14. Let G be the polycyclic group with presentation G := hx1, . . . , x16 | Ri, where the set of polycyclic relations R are given by x 3 1 = 1, x11 2 = 1, x2 3 = x13, x2 4 = x13 · x16, x2 5 = x13, x2 6 = x13, x2 7 = 1, x2 8 = 1, x2 9 = x16, x2 10 = … view at source ↗
Figure 2
Figure 2. Figure 2: B(G) as a union of paths with |ρ(G)| = 2 [PITH_FULL_IMAGE:figures/full_fig_p012_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: B(G) is a union of paths with |ρ(G)| = 3, and |cd(G) ∗ | ≤ 3 isolated vertex of Γ(G) gives the larger component of ∆(G), which is not the case. Thus G has a non-abelian normal Sylow subgroup. This implies that G is not a group of type 4 and so it is a group of type 1. Suppose B(G) is one of the first two graphs in [PITH_FULL_IMAGE:figures/full_fig_p012_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: B(G) is a union of paths with |ρ(G)| = 3, and |cd(G) ∗ | ≥ 4 In analyzing the graphs in this section, the reader should observe how the investigation of B(G) requires the techniques developed for studying the graphs Γ(G) and ∆(G) and also some number theoretic (or arithmetic) considerations. We conclude this section proposing the following problem, which generalizes Question 1 in [10]. (Recall that we have… view at source ↗
Figure 5
Figure 5. Figure 5: Connected bipartite divisor graphs of order at most four [PITH_FULL_IMAGE:figures/full_fig_p017_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Connected bipartite divisor graphs of order five with one or four primes (b) G′ is abelian, G′ ∩ Z(G) = 1 and G Z(G) is a Frobenius group with cyclic complement; (iii) if B(G) has four vertices, then (c) G = AH is the semidirect product of an abelian normal subgroup A and a Hall subgroup H which is either a Sylow p-subgroup of G or an abelian {p, q}-subgroup, or (d) G′ is abelian, G′ ∩ Z(G) = 1 and G Z(G) … view at source ↗
Figure 7
Figure 7. Figure 7: Connected bipartite divisor graphs of order five and two primes [PITH_FULL_IMAGE:figures/full_fig_p018_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Connected bipartite divisor graphs of order five and three primes [PITH_FULL_IMAGE:figures/full_fig_p018_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Disconnected bipartite divisor graphs of order five [PITH_FULL_IMAGE:figures/full_fig_p018_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Disconnected bipartite divisor graphs of order six (part 1) [PITH_FULL_IMAGE:figures/full_fig_p018_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: Disconnected bipartite divisor graphs of order six and three primes (part 2) Finally in the last theorem of this paper, we look at disconnected bipartite graphs with six vertices, and we attempt to determine whether each graph can or cannot occur as the bipartite divisor graph of a solvable group. Theorem 4.5. Let G be a finite group with B(G) disconnected and with six vertices. Then B(G) is one of the gr… view at source ↗
read the original abstract

Let $G$ be a finite group. The bipartite divisor graph for the set of irreducible complex character degrees is the undirected graph with vertex set consisting of the prime numbers dividing some character degree and of the non-identity character degrees, where a prime number $p$ is declared to be adjacent to a character degree $m$ if and only if $p$ divides $m$. This graph is bipartite and it encodes two of the most widely studied graphs associated to the character degrees of a finite group: the prime graph and the divisor graph on the set of irreducible character degrees. The scope of this paper is two-fold. We draw some attention to the bipartite divisor graph for the set of irreducible complex character degrees by outlining the main results that have been proved so far. In this process we improve some of these results and we leave some open problems.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The manuscript surveys the bipartite divisor graph associated to the set of irreducible complex character degrees of a finite group G. Vertices consist of all primes dividing at least one degree together with all non-identity degrees; a prime p is adjacent to a degree m precisely when p divides m. The paper states that this construction encodes both the prime graph and the divisor graph on the degrees, then summarizes the main results proved for the new graph, records some improvements to prior theorems, and lists open problems.

Significance. By exhibiting a single bipartite graph whose two natural projections recover the prime graph and the divisor graph, the survey supplies a unifying perspective on two well-studied objects in character theory. The explicit improvements to existing statements and the collection of open problems are useful reference points for subsequent work.

minor comments (2)
  1. The abstract and introduction both assert that the graph 'encodes' the prime and divisor graphs; a brief sentence in §2 clarifying the precise sense (projection of the bipartition) would remove any ambiguity for readers unfamiliar with the construction.
  2. Several theorems are stated as 'improvements' of earlier results; adding a short table or paragraph that lists the precise strengthening (e.g., removal of a hypothesis, extension to a larger class of groups) would make the contribution easier to locate.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary, recognition of the unifying perspective provided by the bipartite divisor graph, and recommendation to accept the manuscript.

Circularity Check

0 steps flagged

No significant circularity; survey of external results with definitional encoding

full rationale

This is a literature overview paper whose scope is to summarize prior results on the bipartite divisor graph, note improvements, and list open problems. The encoding claim follows directly from the vertex set (primes dividing degrees plus non-identity degrees) and adjacency rule (p adjacent to m iff p divides m) given in the abstract; this is a definitional construction rather than a derived prediction or fitted input. No equations, self-citations, or ansatzes are invoked as load-bearing steps for any central claim. The paper contains no derivation chain that reduces to its own inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

This is a survey paper; the abstract introduces no free parameters, new axioms, or invented entities.

pith-pipeline@v0.9.0 · 5673 in / 904 out tokens · 20863 ms · 2026-05-25T19:18:11.404726+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

33 extracted references · 33 canonical work pages

  1. [1]

    Benjamin, Coprimeness among irreducible character d egrees of finite solvable groups, Proc

    D. Benjamin, Coprimeness among irreducible character d egrees of finite solvable groups, Proc. Amer. Math. Soc. 125(10) (1997), 2831–2837

    work page 1997

  2. [2]

    Bianchi, A

    M. Bianchi, A. Berta Mauri Gillio, M. Herzog, G. Qian, W. S hi, Characterization of non-nilpotent groups with two irre ducible character degrees, J. Algebra 284 (2005), 326-332

    work page 2005

  3. [3]

    Bianchi, D

    M. Bianchi, D. Chillag, M. L. Lewis, E. Pacifici, Characte r degree graphs that are complete graphs, Proc. Amer. Math. Soc. 135 (2007), 671–676

    work page 2007

  4. [4]

    M. W. Bissler, J. Laubacher, M. L. Lewis, Classifying cha racter degree graphs with 6 vertices, Beitr Algebra Geom (2019), https://doi.org/10.1007/s13366-019-00437-y. AN OVER VIEW ON THE BIPARTITE DIVISOR GRAPH FOR THE SET OF IRRE DUCIBLE CHARACTER DEGREES 21

    work page doi:10.1007/s13366-019-00437-y 2019

  5. [5]

    M. W. Bissler, J. Laubacher, Classifying families of cha racter degree graphs of solvable groups, Int. J. Group Theory 8 (2019), 27–46

    work page 2019

  6. [6]

    M. W. Bissler, M. L. Lewis, A family of graphs that cannot o ccur as character degree graphs of solvable groups. arXiv:1707.03020, 2017

    work page arXiv 2017

  7. [7]

    Bubboloni, S

    D. Bubboloni, S. Dolfi, M. A. Iranmanesh, C. E. Praeger, On bipartite divisor graphs for group conjugacy class sizes, Journal of Pure and Applied Algebra 213 (2009), 1722–1734

    work page 2009

  8. [8]

    S. Dolfi, E. Jabara, The structure of finite groups of conju gate rank 2, Bull. London Math. Soc 82 (2010), 167–183

    work page 2010

  9. [9]

    The GAP Group, GAP – Groups, Algorithms, and Programming, Version 4.10.1 ; 2019, (https://www.gap-system.org)

    work page 2019

  10. [10]

    Hafezieh, Bipartite divisor graph for the set of irre ducible character degrees, Int

    R. Hafezieh, Bipartite divisor graph for the set of irre ducible character degrees, Int. J. Group Theory 6 (2017), 41–51

    work page 2017

  11. [11]

    Hafezieh, On regular bipartite divisor graph for the set of irreducible character degrees, Hacettepe J

    R. Hafezieh, On regular bipartite divisor graph for the set of irreducible character degrees, Hacettepe J. Mathematics and Statistics, Doi: 10.15672/HJMS.2018.594

    work page doi:10.15672/hjms.2018.594 2018

  12. [12]

    Hafezieh, M

    R. Hafezieh, M. A. Iranmanesh, Bipartite divisor graph for the product of subsets of integers, Bull. Aust. Math. Soc. 87 (2013), 288–297

    work page 2013

  13. [13]

    Hafezieh, P

    R. Hafezieh, P. Spiga, Groups having complete bipartit e divisor graphs for their conjugacy class sizes, Rend. Sem. Mat. Univ. Padova 133 (2015), 117–123

    work page 2015

  14. [14]

    L. He, M. L. Lewis, Common divisor character degree grap hs of solvable groups with four vertices, Comm. Algebra 43 (2015), 4916–4922

    work page 2015

  15. [15]

    L. He, G. Zhu, Nonsolvable subgroups and irreducible ch aracter degrees, J. Algebra 372 (2012), 68–84

    work page 2012

  16. [16]

    M. A. Iranmanesh, C. E. Praeger, Bipartite divisor grap hs for integer subsets, Graphs and Combinatorics 26 (2010), 95–105

    work page 2010

  17. [17]

    Huppert, Character Theory of Finite Groups, de Gruyter, Berlin , 1998

    B. Huppert, Character Theory of Finite Groups, de Gruyter, Berlin , 1998

    work page 1998

  18. [18]

    I. M. Isaacs, Character theory of finite groups, Academic Press, New York , 1976

    work page 1976

  19. [19]

    M. L. Lewis, Determining group structure from sets of ir reducible character degrees, Journal of Algebra 206 (1998), 235–260

    work page 1998

  20. [20]

    M. L. Lewis, Solvable groups whose degree graphs have tw o connected components, Journal of Group Theory 4 (2001), 255–275

    work page 2001

  21. [21]

    M. L. Lewis, Classifying character degree graphs with 5 vertices. In: Finite groups 2003, 247-265, Walter de Gruyte r GmbH & Co. KG, Berlin, 2004

    work page 2003

  22. [22]

    M. L. Lewis, An overview of graphs associated with chara cter degrees and conjugacy class sizes in finite groups, Rocky Mountain Journal of Math. 38 (2008), 175–211

    work page 2008

  23. [23]

    M. L. Lewis, A. Moret´ o, T. R. Wolf, Nondivisibility amo ng character degrees, J. Group Theory 8 (2005), 561–588

    work page 2005

  24. [24]

    Malle, A

    G. Malle, A. Moret´ o, Nonsolvable groups with few chara cter degrees, Journal of Algebra 294 (2005), 117–126

    work page 2005

  25. [25]

    S. A. Moosavi, On bipartite divisor graph for character degrees, International Journal of Group Theory 6 (2017), 1–7

    work page 2017

  26. [26]

    S. A. Moosavi, Groups whose bipartite divisor graph for character degrees has four or fewer vertices, Asian-European Journal of Mathematics , DOI: 10.1142/S1793557120500394

    work page doi:10.1142/s1793557120500394

  27. [27]

    S. A. Moosavi, Groups whose bipartite graph for charact er degrees has five vertices, Iranian Journal of Mathematical Sciences and Informatics , to appear

    work page

  28. [28]

    Noritzsch, Groups having three complex irreducible character degrees, Journal of Algebra 175 (1995), 767–798

    T. Noritzsch, Groups having three complex irreducible character degrees, Journal of Algebra 175 (1995), 767–798

    work page 1995

  29. [29]

    Shafiei, A

    F. Shafiei, A. Iranmanesh, M. L. Lewis, K. Aziziheris, Fi nite groups with a given set of character degrees, Algebras and Representation Theory 19 (2016), 335–354

    work page 2016

  30. [30]

    Taeri, Cycles and bipartite graph on conjugacy class of groups, Rend

    B. Taeri, Cycles and bipartite graph on conjugacy class of groups, Rend. Sem. Matematico della Universit` a di Padova 123 (2010), 233–247

    work page 2010

  31. [31]

    H. P. Tong-Viet, Groups whose prime graph has no triangl es, Journal of Algebra 378 (2013), 196–206

    work page 2013

  32. [32]

    D. L. White, Character degrees of extensions of PSL 2(q) and SL 2(q), J. Group Theory 16 (2013), 1–33

    work page 2013

  33. [33]

    Zsigmondy, Zur Theorie der Potenzreste, Monatsh

    K. Zsigmondy, Zur Theorie der Potenzreste, Monatsh. Math. Phys. 3 (1892), 265–284. 22 R. HAFEZIEH AND P. SPIGA Roghayeh Hafezieh, Department of Mathematics, Gebze Techn ical University, P.O.Box 41400, Gebze, Turkey E-mail address : roghayeh@gtu.edu.tr P ablo Spiga, Dipartimento di Matematica Pura e Applicata, University of Milano-Bicocca, Via Cozzi 55, 20...

    work page