pith. sign in

arxiv: 1811.07709 · v1 · pith:DCOTC4QWnew · submitted 2018-11-19 · 🧮 math.CO · math.GR

Asymptotic enumeration of Cayley digraphs

classification 🧮 math.CO math.GR
keywords cayleydigraphsgrouppossibleautomorphismsmalltendsalmost
0
0 comments X
read the original 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 $r$ tends to infinity, for every finite group $R$ of order $r$, out of all possible Cayley digraphs on $R$ the proportion whose automorphism group is as small as possible tends to $1$. This proves a natural conjecture first proposed in $1982$ by Babai and Godsil.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.