Pages that link to "Item:Q920104"
From MaRDI portal
The following pages link to Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators (Q920104):
Displaying 50 items.
- Quantum ergodicity for quantum graphs without back-scattering (Q295517) (← links)
- Cutoff on all Ramanujan graphs (Q343522) (← links)
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- On regular hypergraphs of high girth (Q405152) (← links)
- Low-distortion embeddings of graphs with large girth (Q413201) (← links)
- Expanders and property A. (Q422082) (← links)
- Box spaces, group extensions and coarse embeddings into Hilbert space (Q435856) (← links)
- Almost-Ramanujan graphs and prime gaps (Q458598) (← links)
- Embeddable box spaces of free groups (Q464136) (← links)
- Ramanujan complexes and high dimensional expanders (Q466822) (← links)
- Regular graphs of large girth and arbitrary degree (Q485001) (← links)
- Expansion of random graphs: new proofs, new results (Q496208) (← links)
- Corrigendum to: ``Almost-Ramanujan graphs and prime gaps'' (Q499505) (← links)
- On eigenvalues of random complexes (Q503252) (← links)
- Spectra of lifted Ramanujan graphs (Q555601) (← links)
- New spectral lower bounds on the bisection width of graphs (Q596083) (← links)
- Strong uniform expansion in \(\text{SL}(2,p)\). (Q607667) (← links)
- Matching nuts and bolts faster (Q671403) (← links)
- Lifts, derandomization, and diameters of Schreier graphs of Mealy automata (Q681602) (← 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)
- On universal hypergraphs (Q727206) (← links)
- Kazhdan groups have cost 1 (Q785942) (← links)
- Ramanujan complexes of type \(\widetilde A_d\) (Q814142) (← links)
- Upper bounds on the bisection width of 3- and 4-regular graphs (Q849636) (← links)
- Cayley-type graphs for group-subgroup pairs (Q896858) (← links)
- Cycle lengths in sparse graphs (Q949802) (← links)
- On the homogeneous algebraic graphs of large girth and their applications (Q1006033) (← links)
- Expander graphs based on GRH with an application to elliptic curve cryptography (Q1019852) (← links)
- Hamiltonian paths in Cayley graphs (Q1044918) (← links)
- On the second eigenvalue of a graph (Q1182585) (← links)
- On sparse spanners of weighted graphs (Q1196368) (← links)
- Cubic Ramanujan graphs (Q1200273) (← links)
- Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs (Q1306928) (← links)
- Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling (Q1331949) (← links)
- Hash functions and Cayley graphs (Q1335422) (← links)
- On the connectivity of certain graphs of high girth. (Q1426127) (← links)
- Wavelength routing in optical networks of diameter two (Q1612298) (← links)
- Linear-time list recovery of high-rate expander codes (Q1640994) (← links)
- On the chromatic number of structured Cayley graphs (Q1671781) (← links)
- Ramanujan coverings of graphs (Q1682000) (← links)
- The integrity of a cubic graph (Q1827848) (← links)
- On the second eigenvalue of hypergraphs (Q1842569) (← links)
- Ramanujan edge-indexed graphs (Q1850521) (← links)
- On the decisional complexity of problems over the reals (Q1854429) (← links)
- Tough Ramsey graphs without short cycles (Q1893953) (← links)
- Explicit construction of graphs with an arbitrary large girth and of large size (Q1894370) (← links)
- A characterization of the components of the graphs \(D(k,q)\) (Q1924372) (← links)
