2015
DOI: 10.4171/rsmup/133-6
|View full text |Cite
|
Sign up to set email alerts
|

Groups having complete bipartite divisor graphs for their conjugacy class sizes

Abstract: Given a finite group G, the bipartite divisor graph for its conjugacy class sizes is the bipartite graph with bipartition consisting of the set of conjugacy class sizes of G \ Z(G) (where Z(G) denotes the centre of G) and the set of prime numbers that divide these conjugacy class sizes, and with {p, n} being an edge if gcd(p, n) = 1.In this paper we construct infinitely many groups whose bipartite divisor graph for their conjugacy class sizes is the complete bipartite graph K2,5, giving a solution to a questio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 15 publications
(17 reference statements)
0
3
0
Order By: Relevance
“…Here we observe that there exist groups G where B(G) is an arbitrary complete bipartite graph. The analogous problem for the bipartite divisor graph for the set of conjugacy class sizes seems considerably harder; it is widely open and it is stated in [13]. Let k be a positive integer and let G := H k be the Cartesian product of k copies of H. Clearly, cd(G) = {1, n, n 2 , .…”
Section: 3mentioning
confidence: 99%
See 2 more Smart Citations
“…Here we observe that there exist groups G where B(G) is an arbitrary complete bipartite graph. The analogous problem for the bipartite divisor graph for the set of conjugacy class sizes seems considerably harder; it is widely open and it is stated in [13]. Let k be a positive integer and let G := H k be the Cartesian product of k copies of H. Clearly, cd(G) = {1, n, n 2 , .…”
Section: 3mentioning
confidence: 99%
“…Since C 4 is also the complete bipartite graph K 2,2 and since there is no finite group G with B(Cl(G)) ∼ = K 2,2 , Taeri [30, Question 1] has asked whether B(Cl(G)) can be isomorphic to some complete bipartite graph. In [13], we answered this question and we constructed infinitely many groups G with B(Cl(G)) ∼ = K 2,5 . However, as far as we are aware, it is not known for which positive integers n and m there exists a finite group G with B(Cl(G)) ∼ = K n,m (let alone a meaningful classification of the groups G with B(Cl(G)) ∼ = K n,m ).…”
Section: An Active Line Of Research Studies the Relations Between Str...mentioning
confidence: 99%
See 1 more Smart Citation