Explicit construction of regular graphs without small cycles
- Cite this article as:
- Imrich, W. Combinatorica (1984) 4: 53. doi:10.1007/BF02579157
- 94 Downloads
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.