31 problems
Let be a finite regular graph, and let be a 2-lift of . An eigenvalue of not inherited from is called new, and let denote the relevant un…
Let be fixed and let be large. Consider Cayley graphs of generated by random generating sets, together with the analogous graphs for the proj…
Let be a uniformly random simple -regular graph, and write … for the maximum absolute value of its nontrivial adjacency eigenvalues. A -regular graph is Ramanujan w…
View a graph from model (R1') as a random -cover of a bouquet, the one-vertex multigraph with self-loops. Hall–Puder–Sawin's conjecture. Their proof should work in this sett…
Folklore conjecture. The Ramanujan graphs constructed by Lubotzky, Phillips, and Sarnak should be lossless expanders.
Level-packet invariant-vector conjecture. If the non-tempered representation in the A-packet has no -invariant vectors, then neither does the supercuspidal representation fro…
Let and be distinct odd primes with and Legendre symbol , let , and let b…
Let be a sequence of Ramanujan graphs, let denote the number of vertices, let be their common degree, and set . Let be the average squared dist…
Let be fixed and large, and let be the family of -regular Ramanujan graphs constructed by Lubotzky, Phillips, and Sarnak. For a vertex set , write…
Camarero–Martínez conjecture. The graph is a Ramanujan graph for every prime such that .
Let be a prime power, let be the finite field with elements, and let satisfy . Let be the associated -…
Let be a -regular Ramanujan graph, and let . Sarnak's diameter conjecture. The diameter of is bounded from above by … as . This is stronger…
Let satisfy … Four-square strong approximation conjecture. If , then there exists…
Let range over LPS Ramanujan graphs, and let denote the number of vertices. Sardari's diameter conjecture. The diameter is asymptotically … The paper states that the lowe…
Fix an integer , and let be a -regular connected Ramanujan graph, with vertices. Let denote its diameter. Ramanujan graph diameter co…
Mohar's conjecture. For every degree matrix , if is weakly Ramanujan, then it is -quasi-Ramanujan; moreover, if , then is Ramanujan. Th…
Let be a finite graph, and let be a lift of . Write for the spectrum of , and let denote the relevant universal-cover spect…
Asymptotic Ramanujan conjecture. If , then is asymptotically Ramanujan; equivalently,
Let be the LPS Ramanujan graph, whose vertices are represented by when is a quadratic residue modulo . The diameter c…
Let be an odd prime, let , and let be Allen's Cayley graph on the specified subgroup of . Le…
Let be a random -regular digraph on vertices, and let denote its nontrivial spectral radius. Almost-Ramanujan conjecture for random regular…
Asymptotic distance conjecture. For almost all such diagonal vertices, the distance from to the identity vertex is
Let and be primes, and let be the associated LPS Ramanujan graph. Asymptotic diameter conjecture. The diameter of is asymptotic to … The preceding resul…
Optimal strong approximation conjecture. The same strong approximation result as for quadratic forms in five or more variables should hold for provided that
Proportion conjecture. As , the proportion of Ramanujan graphs among all -regular graphs on vertices tends to a constant in .