Ramanujan Graphs with Small Girth

Simple item page
dc.creatorGlasner, Yair
dc.date2003-06-11
dc.date.accessioned2026-07-07T04:58:55Z
dc.date.available2026-07-07T04:58:55Z
dc.descriptionWe construct an infinite family of (q+1)-regular Ramanujan graphs X_n of girth 1. We also give covering maps X_{n+1} --> X_n such that the minimal common covering of all the graphs is the universal covering tree.
dc.description14 pages, 1 figure. to appear: Combinatorica
dc.identifierhttps://arxiv.org/abs/math/0306196
dc.identifierhttp://arxiv.org/abs/math/0306196
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/67779
dc.subjectCombinatorics
dc.subjectGroup Theory
dc.subject05c (Primary) 05C25; 22E40 (Secondary)
dc.titleRamanujan Graphs with Small Girth
dc.typetext

Files

Collections

arXiv