2020
DOI: 10.1016/j.disc.2020.111913
|View full text |Cite|
|
Sign up to set email alerts
|

A conjecture on bipartite graphical regular representations

Abstract: In this paper we are concerned with the classification of the finite groups admitting a bipartite DRR and a bipartite GRR.First, we find a natural obstruction in a finite group for not admitting a bipartite GRR. Then we give a complete classification of the finite groups satisfying this natural obstruction and hence not admitting a bipartite GRR. Based on these results and on some extensive computer computations, we state a conjecture aiming to give a complete classification of the finite groups admitting a bi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
3

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…However, we observe that the work of Fitzpatrick, Hegarty, Liebeck, and MacHale [8,10,14] on groups admitting automorphisms inverting many elements seems to be relevant. (During the refereeing process of this paper, we have given an explicit description of the groups satisfying the second condition in Conjecture 1.15, see [7]. )…”
Section: ⊆ ⊆ ≥mentioning
confidence: 99%
“…However, we observe that the work of Fitzpatrick, Hegarty, Liebeck, and MacHale [8,10,14] on groups admitting automorphisms inverting many elements seems to be relevant. (During the refereeing process of this paper, we have given an explicit description of the groups satisfying the second condition in Conjecture 1.15, see [7]. )…”
Section: ⊆ ⊆ ≥mentioning
confidence: 99%
“…For instance, we classify the finite groups G having an abelian subgroup A of index 2 admitting a bipartite DRR having bipartition {A, G \ A}. The analogous classification for Cayley graphs is much harder, see [9,10]. In fact, we do not have a classification of finite groups admitting a Haar graphical representation and hence we have no classification of finite groups admitting an n-partite graphical representation, when n ≥ 2.…”
Section: Introductionmentioning
confidence: 99%