Da-Ke He, Ashish Jagmohan, et al.
ISIT 2007
We prove that random d-regular Cayley graphs of the symmetric group asymptotically almost surely have girth at least (logd-1 |G|)1/2/2 and that random d-regular Cayley graphs of simple algebraic groups over Fq asymptotically almost surely have girth at least logd-1 |G|/ dim(G). For the symmetric p-groups the girth is between log log|G|and (log|G|)α with α < 1. Several conjectures and open questions are presented. © 2009 Wiley Periodicals, Inc.
Da-Ke He, Ashish Jagmohan, et al.
ISIT 2007
Zhengxin Zhang, Ziv Goldfeld, et al.
Foundations of Computational Mathematics
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009