Name
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. |
Year | DOI | Venue |
|---|---|---|
1984 | 10.1007/BF02579157 | Combinatorica |
Keywords | Field | DocType |
05 C 35, 05 C 38, 05 C 25, 20 E 05 | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Mathematics | Journal |
Volume | Issue | ISSN |
4 | 1 | 1439-6912 |
Citations | PageRank | References |
15 | 7.87 | 1 |
Authors | ||
1 | ||