Pages that link to "Item:Q1333324"
From MaRDI portal
The following pages link to Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\) (Q1333324):
Displaying 50 items.
- Quantum ergodicity for quantum graphs without back-scattering (Q295517) (← links)
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- On regular hypergraphs of high girth (Q405152) (← links)
- Almost-Ramanujan graphs and prime gaps (Q458598) (← links)
- Ramanujan complexes and high dimensional expanders (Q466822) (← links)
- Regular graphs of large girth and arbitrary degree (Q485001) (← links)
- Lower bounds for tropical circuits and dynamic programs (Q493653) (← links)
- Expansion of random graphs: new proofs, new results (Q496208) (← links)
- Corrigendum to: ``Almost-Ramanujan graphs and prime gaps'' (Q499505) (← links)
- Explicit constructions of Ramanujan complexes of type \(\widetilde A_d\). (Q557608) (← links)
- New spectral lower bounds on the bisection width of graphs (Q596083) (← links)
- Classical Kloosterman sums: representation theory, magic squares, and Ramanujan multigraphs (Q627626) (← links)
- Finite simple groups of Lie type as expanders. (Q638776) (← links)
- Sparse regular random graphs: spectral density and eigenvectors (Q690878) (← links)
- A lower bound on the spectral radius of the universal cover of a graph (Q707021) (← links)
- The measurable Kesten theorem (Q726790) (← links)
- Ramanujan complexes of type \(\widetilde A_d\) (Q814142) (← links)
- Upper bounds on the bisection width of 3- and 4-regular graphs (Q849636) (← links)
- A bipartite analogue of Dilworth's theorem (Q862983) (← links)
- Problems and results in extremal combinatorics. II (Q941386) (← links)
- On cycle lengths in claw-free graphs with complete closure (Q960969) (← links)
- Optimal configurations for peer-to-peer user-private information retrieval (Q980206) (← links)
- On \(k\)-chromatically connected graphs (Q1045036) (← links)
- Expanding graphs and invariant means (Q1276303) (← links)
- An application of Ramanujan graphs to \(C^*\)-algebra tensor products (Q1356499) (← links)
- Finite fields and Ramanujan graphs (Q1362096) (← links)
- Relative expanders or weakly relatively Ramanujan graphs. (Q1421136) (← links)
- Not every uniform tree covers Ramanujan graphs (Q1569026) (← links)
- Linear-time list recovery of high-rate expander codes (Q1640994) (← links)
- Local expanders (Q1653336) (← links)
- Ramanujan coverings of graphs (Q1682000) (← links)
- On the planar split thickness of graphs (Q1742373) (← links)
- On sensitivity of mixing times and cutoff (Q1748929) (← links)
- Natural bounded concentrators (Q1842573) (← links)
- The Ramanujan property for regular cubical complexes (Q1847773) (← links)
- Ramanujan edge-indexed graphs (Q1850521) (← links)
- Erdős-Hajnal-type results for monotone paths (Q1984509) (← links)
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey (Q2042199) (← links)
- An explicit infinite family of \(\mathbb{M}\)-vertex graphs with maximum degree \(K\) and diameter \([1+o(1)]\log_{K-1}\mathbb{M}\) for each \(K-1\) a prime power (Q2043762) (← links)
- Kissing numbers of regular graphs (Q2095114) (← links)
- New and explicit constructions of unbalanced Ramanujan bipartite graphs (Q2115273) (← links)
- Ramanujan graphs and exponential sums over function fields (Q2197504) (← links)
- Regular partitions of gentle graphs (Q2216929) (← links)
- A connection between a question of Bermond and Bollobás and Ramanujan graphs (Q2230812) (← links)
- Explicit expanders of every degree and size (Q2236654) (← links)
- Combinatorial algorithms for distributed graph coloring (Q2251151) (← links)
- No sublogarithmic-time approximation scheme for bipartite vertex cover (Q2256970) (← links)
- Ramanujan graphs and expander families constructed from \(p\)-ary bent functions (Q2291671) (← links)
- Opinion forming in Erdős-Rényi random graph and expanders (Q2306607) (← links)
- Local correctability of expander codes (Q2347805) (← links)
