Related papers: Ramanujan graphs of very large girth based on octo…
Expander graphs in general, and Ramanujan graphs in particular, have been of great interest in the last three decades with many applications in computer science, combinatorics and even pure mathematics. In these notes we describe various…
We 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.
Ramanujan graphs are graphs whose spectrum is bounded optimally. Such graphs have found numerous applications in combinatorics and computer science. In recent years, a high dimensional theory has emerged. In this paper these developments…
This paper considers a higher-dimensional generalization of the notion of Ramanujan graphs, defined by Lubotzky, Phillips, and Sarnak. Specifically the Ramanujan property is studied for cubical complexes which are uniformized by an ordered…
Recently, a construction of minimal codes arising from a family of almost Ramanujan graphs was shown. Ramanujan graphs are examples of expander graphs that minimize the second-largest eigenvalue of their adjacency matrix. We call such…
The question of finding expander graphs with strong vertex expansion properties such as unique neighbor expansion and lossless expansion is central to computer science. A barrier to constructing these is that strong notions of expansion…
We construct (k+-1)-regular graphs which provide sequences of expanders by adding or substracting appropriate 1-factors from given sequences of k-regular graphs. We compute numerical examples in a few cases for which the given sequences are…
For every integer d > 9, we construct infinite families {G_n}_n of d+1-regular graphs which have a large girth > log_d |G_n|, and for d large enough > 1,33 log_d |G_n|. These are Cayley graphs on PGL_2(q) for a special set of d+1 generators…
A recent result of Cioab\u{a}, Dewar and Gu implies that any $k$-regular Ramanujan graph with $k\geq 8$ is globally rigid in $\mathbb{R}^2$. In this paper, we extend these results and prove that any $k$-regular Ramanujan graph of…
We prove that $q+1$-regular Morgenstern Ramanujan graphs $X^{q,g}$ (depending on $g\in\mathbb{F}_q[t]$) have diameter at most $\left(\frac{4}{3}+\varepsilon\right)\log_{q}|X^{q,g}|+O_{\varepsilon}(1)$ (at least for odd $q$ and irreducible…
We prove that there exist bipartite Ramanujan graphs of every degree and every number of vertices. The proof is based on analyzing the expected characteristic polynomial of a union of random perfect matchings, and involves three…
We construct an infinite family of 6-regular graphs $\{G_n\}_{n\ge 3}$ by taking $n$ copies of the Petersen graph and wiring corresponding vertices according to an $n$-cycle permutation. Each $G_n$ has $10n$ vertices, $30n$ edges, and…
Ramanujan graphs have fascinating properties and history. In this paper we explore a parallel notion of Ramanujan digraphs, collecting relevant results from old and recent papers, and proving some new ones. Almost-normal Ramanujan digraphs…
We prove that there exist infinite families of regular bipartite Ramanujan graphs of every degree bigger than 2. We do this by proving a variant of a conjecture of Bilu and Linial about the existence of good 2-lifts of every graph. We also…
We construct an infinite family of bounded-degree bipartite unique-neighbour expander graphs with arbitrarily unbalanced sides. Although weaker than the lossless expanders constructed by Capalbo et al., our construction is simpler and may…
Expander graphs have many interesting applications in communication networks and other areas, and thus these graphs have been extensively studied in theoretic computer sciences and in applied mathematics. In this paper, we use reversible…
The method of Murty and Cioab\u{a} shows how one can use results about gaps between primes to construct families of almost-Ramanujan graphs. In this paper we give a simpler construction which avoids the search for perfect matchings and thus…
In their seminal paper, Lubotzky, Phillips and Sarnak (LPS) defined the notion of regular Ramanujan graphs and gave an explicit construction of infinite families of $(p+1)$-regular Ramanujan Cayley graphs, for infinitely many primes $p$. In…
In this paper we construct explicit LPS-type Ramanujan graphs from each definite quaternion algebra over $\mathbb Q$ of class number 1, extending the constructions of Lubotzky, Phillips, Sarnak, and later Chiu, and answering in the…
In this paper we present experimental ways of evaluating Ramanujan`s quantities which as someone can see are related with algebraic numbers. The good thing with algebraic numbers is that can be found in a closed form, from there…