paper

Asymptotic enumeration of Cayley digraphs

arXiv:1811.07709

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 tends to infinity, for every finite group of order , out of all possible Cayley digraphs on the proportion whose automorphism group is as small as possible tends to . This proves a natural conjecture first proposed in by Babai and Godsil.

24 pages

Asymptotic enumeration of Cayley digraphs · wovepaper