Explicit construction of regular graphs without small cycles (Q790830): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5725269 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Explicit constructions of graphs without short cycles and low density codes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5341595 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5512010 / rank | |||
Normal rank | |||
Latest revision as of 11:15, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Explicit construction of regular graphs without small cycles |
scientific article |
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
