Abelian Cayley digraphs with asymptotically large order for any given degree
classification
🧮 math.CO
keywords
asymptoticallydigraphsabeliancayleydegreelargeapproachbest
read the original abstract
Abelian Cayley digraphs can be constructed by using a generalization to $Z^n$ of the concept of congruence in $Z$. Here we use this approach to present a family of such digraphs, which, for every fixed value of the degree, have asymptotically large number of vertices as the diameter increases. Up to now, the best known asymptotically dense results were all non-constructive.
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.