David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
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.
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Igor Devetak, Andreas Winter
ISIT 2003
Trang H. Tran, Lam Nguyen, et al.
INFORMS 2022
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University