We use Margulis’ construction together with lattice counting arguments to build Cayley graphs on SL2(Fp), p→∞SL2(Fp),p→∞ which are d-regular graphs with girth ≥23ln(n)ln(d−1)+ln(C)≥32ln(d−1)+ln(C)ln(n) for some absolute constant C.
生成讲解博客的中文版本
生成AI智能校验的中文版本