Xu's asymptotic conjecture for normal Cayley digraphs

For each group RR of order rr, let SS be an inverse-closed subset of RR, and let Γ(R,S)\mathop{\Gamma}(R,S) be the associated Cayley digraph. It is normal when

RAut(Γ(R,S)).R\unlhd\mathop{\mathrm{Aut}}(\mathop{\Gamma}(R,S)).

Xu's conjecture. The minimum, over all groups RR of order rr, of the proportion of inverse-closed subsets SS of RR such that Γ(R,S)\mathop{\Gamma}(R,S) is a normal Cayley digraph tends to 11 as rr\to\infty.

This is the formal asymptotic enumeration version of Xu's conjecture and is presented by the paper as equivalent to the Babai–Godsil conjecture. The supplied material gives no resolution status.

Sources & referencesView supporting material

Primary source

Pablo Spiga, “On the equivalence between a conjecture of Babai-Godsil and a conjecture of Xu concerning the enumeration of Cayley graphs”, arXiv:1911.09444 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.