Explicit construction of regular graphs without small cycles

Research output: Contribution to journalArticleResearchpeer-review

28 Citations (Scopus)

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 languageEnglish
Pages (from-to)53-59
Number of pages7
JournalCombinatorica
Volume4.1984
Issue number1
DOIs
Publication statusPublished - Mar 1984

Keywords

  • AMS subject classification (1980): 05C35, 05C38, 05C25, 20E05

Cite this