The following pages link to Ramanujan graphs (Q1112836):
Displaying 50 items.
- Higher index theory for certain expanders and Gromov monster groups. I (Q664746) (← links)
- Matching nuts and bolts faster (Q671403) (← links)
- On the girth of infinite graphs (Q685556) (← links)
- Laplace eigenvalues of graphs---a survey (Q686298) (← links)
- Optimal slope selection via expanders (Q689630) (← links)
- Sparse regular random graphs: spectral density and eigenvectors (Q690878) (← links)
- Highly symmetric expanders (Q700158) (← links)
- A lower bound on the spectral radius of the universal cover of a graph (Q707021) (← links)
- On the limitations of the use of solvable groups in Cayley graph cage constructions (Q709252) (← links)
- Geodesics with one self-intersection, and other stories (Q715200) (← links)
- On the chromatic number of a simplicial complex (Q722323) (← links)
- A generalized Alon-Boppana bound and weak Ramanujan graphs (Q726663) (← links)
- The measurable Kesten theorem (Q726790) (← links)
- On universal hypergraphs (Q727206) (← links)
- Hecke graphs, Ramanujan graphs and generalized duality transformations for lattice spin systems (Q741184) (← links)
- The second eigenvalue of regular graphs of given girth (Q757426) (← links)
- Parallel sorting on Cayley graphs (Q807014) (← links)
- On the spectral gap for infinite index ``congruence'' subgroups of \(SL_2(\mathbb{Z})\) (Q811767) (← links)
- Ramanujan complexes of type \(\widetilde A_d\) (Q814142) (← links)
- Spectral analysis of the affine graph over the finite ring (Q819772) (← links)
- Explicit spectral gaps for random covers of Riemann surfaces (Q827017) (← links)
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- Affine linear sieve, expanders, and sum-product (Q849252) (← links)
- Upper bounds on the bisection width of 3- and 4-regular graphs (Q849636) (← links)
- Zeta functions of finite graphs and coverings. III (Q854111) (← links)
- Robust gossiping with an application to consensus (Q856404) (← links)
- Poisson-Dirichlet distribution for random Belyi surfaces (Q858984) (← links)
- A bipartite analogue of Dilworth's theorem (Q862983) (← links)
- Cayley-type graphs for group-subgroup pairs (Q896858) (← links)
- Small-diameter Cayley graphs for finite simple groups (Q914696) (← links)
- Note on the girth of Ramanujan graphs (Q920107) (← links)
- A lower bound on the area of permutation layouts (Q922710) (← links)
- On 3rd and 4th moments of finite upper half plane graphs (Q946875) (← links)
- Complexity measures of sign matrices (Q949752) (← links)
- A separation theorem in property testing (Q949795) (← links)
- Cycle lengths in sparse graphs (Q949802) (← links)
- The Steiner tree problem on graphs: inapproximability results (Q952442) (← links)
- A bipartite strengthening of the crossing Lemma (Q968451) (← links)
- Gossiping by processors prone to omission failures (Q976104) (← links)
- Optimal configurations for peer-to-peer user-private information retrieval (Q980206) (← links)
- A robust randomized algorithm to perform independent tasks (Q1002110) (← links)
- Expander graphs based on GRH with an application to elliptic curve cryptography (Q1019852) (← links)
- Cryptographic hash functions from expander graphs (Q1027970) (← links)
- Minimum cuts, girth and a spectral threshold (Q1029057) (← links)
- Hamiltonian paths in Cayley graphs (Q1044918) (← links)
- On \(k\)-chromatically connected graphs (Q1045036) (← links)
- Explicit construction of linear sized tolerant networks (Q1110541) (← links)
- Tactical configurations and their generic ring (Q1115448) (← links)
- Sorting in rounds (Q1117700) (← links)
- A note on the token distribution problem (Q1178250) (← links)
