Abstract
For every integerd>2 we give an explicit construction of infinitely many Cayley graphsX of degreed withn(X) vertices and girth >0.4801...(logn(X))/log (d−1)−2. This improves a result of Margulis.
Similar content being viewed by others
References
P. Erdős andH. Sachs, Reguläre Graphen gegebener Taillenweite mit minimaler Knotenzahl,Wiss. Z. Univ. Halle—Wittenberg, Math.-Nat. R. 12 (1963), 251–258.
P. J. Higgings,Categories and Groupoids, Van Nostrand, London, 1971.
W. Imrich, Subgroup theorems and graphs,Combinatorial Mathematics, V (Proc. Fifth Austral. Conf. Roy. Melbourne Inst. Techn., Melbourne, 1976), pp. 1–27.Lecture Notes in Math.622, Springer, Berlin, 1977.
W. Magnus, A. Karrass andD. Solitar,Combinatorial group theory, Interscience, N.Y. 1966.
G. A. Margulis Graphs without short cycles,Combinatorica 2 (1982), 71–78.
H. Walther, Über reguläre Graphen gegebener Taillenweite und minimaler Knotenzahl,Wiss. Z. HfE Ilmenau 11 (1965), 93–96.
H. Walther, Eigenschaften von regulären Graphen gegebener Taillenweite und minimaler Knotenzahl,Wiss. Z. HfE Ilmenau 11 (1965), 167–168.
Author information
Authors and Affiliations
Additional information
Dedicated to Paul Erdős on his seventieth birthday