The following pages link to Ramanujan graphs (Q1112836):
Displayed 50 items.
- Explicit constructions of Ramanujan complexes of type \(\widetilde A_d\). (Q557608) (← links)
- New spectral lower bounds on the bisection width of graphs (Q596083) (← links)
- Colorings of the \(d\)-regular infinite tree (Q598463) (← 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)
- Highly symmetric expanders (Q700158) (← links)
- A lower bound on the spectral radius of the universal cover of a graph (Q707021) (← 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)
- 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)
- 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 robust randomized algorithm to perform independent tasks (Q1002110) (← links)
- Expander graphs based on GRH with an application to elliptic curve cryptography (Q1019852) (← 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)
- On the second eigenvalue of a graph (Q1182585) (← links)
- The symbiotic relationship of combinatorics and matrix theory (Q1183182) (← links)
- A domain monotonicity theorem for graphs and Hamiltonicity (Q1192950) (← links)
- On sparse spanners of weighted graphs (Q1196368) (← links)
- Cubic Ramanujan graphs (Q1200273) (← links)
- Some geometric aspects of graphs and their eigenfunctions (Q1261117) (← links)
- On eigenvalues related to finite Poincaré planes (Q1266419) (← links)
- The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs (Q1270774) (← links)
- Covering odd cycles (Q1272187) (← links)
- On the spectra of certain graphs arising from finite fields (Q1273216) (← links)
- Expanding graphs and invariant means (Q1276303) (← links)
- Approximating hyper-rectangles: Learning and pseudorandom sets (Q1278043) (← links)
- Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger? (Q1296583) (← links)
- On the spectrum, the growth, and the diameter of a graph (Q1305521) (← links)
- Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs (Q1306928) (← links)
- Around quasidiagonal operators (Q1316453) (← links)
- On the relationship between the diameter and the size of a boundary of a directed graph (Q1329425) (← links)