English

Existence of non-Cayley Haar graphs

Combinatorics 2019-08-14 v1

Abstract

A Cayley graph of a group HH is a finite simple graph Γ\Gamma such that its automorphism group Aut(Γ){\rm Aut}(\Gamma) contains a subgroup isomorphic to HH acting regularly on V(Γ)V(\Gamma), while a Haar graph of HH is a finite simple bipartite graph Σ\Sigma such that Aut(Σ){\rm Aut}(\Sigma) contains a subgroup isomorphic to HH acting semiregularly on V(Σ)V(\Sigma) and the HH-orbits are equal to the partite sets of Σ\Sigma. 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 D6D_6, D8D_8, D10D_{10}, the quaternion group Q8Q_8 and the group Q8×Z2Q_8\times\mathbb{Z}_2. This answers an open problem proposed by Est\'elyi and Pisanski in 2016.

Keywords

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}
}
R2 v1 2026-06-23T10:46:06.357Z