Explicit construction of regular graphs without small cycles
type: Item
instance of: scholarly article
title: Explicit construction of regular graphs without small cycles
zbMATH Open document ID: 0535.05033
DOI: 10.1007/BF02579157
author: Wilfried Imrich
published in: Combinatorica
publication date: 1984-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 3849261
zbMATH Keywords: Cayley graphs
zbMATH Keywords: girth
MaRDI profile type: Publication
cites work: Q5725269
cites work: Explicit constructions of graphs without short cycles and low density codes
cites work: Q5341595
cites work: Q5512010
description: scientific article; zbMATH DE number 3849261