Ramanujan Graphs with Small Girth
Yair Glasner
math.COarXiv:math/0306196
Abstract
We construct an infinite family of (q+1)-regular Ramanujan graphs Xn of girth 1. We also give covering maps Xn+1 --> Xn such that the minimal common covering of all the graphs is the universal covering tree.
Create a lesson
Related papers
Fractional colorings of Kr-free graphs with local demands
Ewan Davies, Abhishek Dhawan, Abhishek Methuku et al.
Short permutation pattern waves: The complete length-five classification
Lihong Qiu, Minglei Mao, Yaping Mao
Automatic partition identities
Laurent Bartholdi
Well-Covered Powers: Cartesian Products and Cayley Graphs
Haobo Ma, Thanh Vu, Wenlin Zhang
Lemmas and Conjectures in Spectral Graph Theory
Tristan Cazenave
On the lower- and upper bounds of three-colored anti-Ramsey numbers
Máté Giesz