English

Asymptotic enumeration of Cayley digraphs

Combinatorics 2018-11-20 v1 Group Theory

Abstract

In this paper we show that almost all Cayley digraphs have automorphism group as small as possible; that is, they are digraphical regular representations (DRRs). More precisely, we show that as rr tends to infinity, for every finite group RR of order rr, out of all possible Cayley digraphs on RR the proportion whose automorphism group is as small as possible tends to 11. This proves a natural conjecture first proposed in 19821982 by Babai and Godsil.

Keywords

Cite

@article{arxiv.1811.07709,
  title  = {Asymptotic enumeration of Cayley digraphs},
  author = {Joy Morris and Pablo Spiga},
  journal= {arXiv preprint arXiv:1811.07709},
  year   = {2018}
}

Comments

24 pages