pith. sign in

arxiv: 0707.1833 · v1 · pith:OR4DO2F5new · submitted 2007-07-12 · 🧮 math.PR · math.GR

On the girth of random Cayley graphs

classification 🧮 math.PR math.GR
keywords girthcayleygraphsrandomalmostalphaasymptoticallyd-regular
0
0 comments X
read the original abstract

We prove that random d-regular Cayley graphs of the symmetric group asymptotically almost surely have girth at least (log_{d-1}|G|)^{1/2}/2 and that random d-regular Cayley graphs of simple algebraic groups over F_q asymptotically almost surely have girth at least log_{d-1}|G|/dim(G). For the symmetric p-groups the girth is between log log |G| and (log|G|)^alpha with alpha<1. Several conjectures and open questions are presented.

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.