Asymptotic enumeration of vertex-transitive graphs of fixed valency

From MaRDI portal
Publication:345083




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.



Cites work







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)