Asymptotic enumeration of vertex-transitive graphs of fixed valency

From MaRDI portal
Publication:345083

DOI10.1016/J.JCTB.2016.06.002zbMATH Open1350.05064arXiv1210.5736OpenAlexW1514154349MaRDI QIDQ345083FDOQ345083

Pablo Spiga, Primož Potočnik, Gabriel Verret

Publication date: 25 November 2016

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Abstract: Let G be a group and let S be an inverse-closed and identity-free generating set of G. The emph{Cayley graph} Cay(G,S) has vertex-set G and two vertices u and v are adjacent if and only if uv1inS. Let CAYd(n) be the number of isomorphism classes of d-valent Cayley graphs of order at most n. We show that log(CAYd(n))inTheta(d(logn)2), as noinfty. We also obtain some stronger results in the case d=3.


Full work available at URL: https://arxiv.org/abs/1210.5736




Recommendations




Cites Work


Cited In (8)





This page was built for publication: Asymptotic enumeration of vertex-transitive graphs of fixed valency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q345083)