Explicit construction of regular graphs without small cycles (Q790830)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Explicit construction of regular graphs without small cycles |
scientific article; zbMATH DE number 3849261
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Explicit construction of regular graphs without small cycles |
scientific article; zbMATH DE number 3849261 |
Statements
Explicit construction of regular graphs without small cycles (English)
0 references
1984
0 references
Explicit constructions of Cayley graphs with large girth were given in \textit{G. A. Margulis} [Combinatorica 2, 71-78 (1982; Zbl 0492.05044)]. Specifically he showed how to construct infinitely many Cayley graphs X of degree d on n(X) vertices with girth larger than g, where g was specified. In this paper the bound for g is improved to \(0.4801...\log n(X)/\log(d-1)-2.\) The techniques used are similar to those of Margulis.
0 references
Cayley graphs
0 references
girth
0 references
0.8630001544952393
0 references
0.8260345458984375
0 references
0.8115134239196777
0 references
0.8102350831031799
0 references
