Explicit construction of regular graphs without small cycles (Q790830): Difference between revisions

Explicit constructions of Cayley graphs with large girth were given in \textit{G. A. Margulis} [Combinatorica 2, 71-78 (1982; Zbl 0492.05044)]. Specifically he showed how to construct infinitely many Cayley graphs X of degree d on n(X) vertices with girth larger than g, where g was specified. In this paper the bound for g is improved to \(0.4801...\log n(X)/\log(d-1)-2.\) The techniques used are similar to those of Margulis.