Xu's asymptotic conjecture for normal Cayley digraphs
Xu's asymptotic conjecture for normal Cayley digraphs
For each group of order , let be an inverse-closed subset of , and let be the associated Cayley digraph. It is normal when
Xu's conjecture. The minimum, over all groups of order , of the proportion of inverse-closed subsets of such that is a normal Cayley digraph tends to as .
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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.