Existence of non-Cayley Haar graphs
Combinatorics
2019-08-14 v1
Abstract
A Cayley graph of a group is a finite simple graph such that its automorphism group contains a subgroup isomorphic to acting regularly on , while a Haar graph of is a finite simple bipartite graph such that contains a subgroup isomorphic to acting semiregularly on and the -orbits are equal to the partite sets of . It is well-known that every Haar graph of finite abelian groups is a Cayley graph. In this paper, we prove that every finite non-abelian group admits a non-Cayley Haar graph except the dihedral groups , , , the quaternion group and the group . This answers an open problem proposed by Est\'elyi and Pisanski in 2016.
Cite
@article{arxiv.1908.04551,
title = {Existence of non-Cayley Haar graphs},
author = {Yan-Quan Feng and István Kovács and Jie Wang and Da-Wei Yang},
journal= {arXiv preprint arXiv:1908.04551},
year = {2019}
}