Abstract
For every integer d>2 we give an explicit construction of infinitely many Cayley graphs X of degree d with n(X) vertices and girth >0.4801...(log n(X))/log (d-1)-2. This improves a result of Margulis.
| Original language | English |
|---|---|
| Pages (from-to) | 53-59 |
| Number of pages | 7 |
| Journal | Combinatorica |
| Volume | 4.1984 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Mar 1984 |
Keywords
- AMS subject classification (1980): 05C35, 05C38, 05C25, 20E05