Explicit Near-Ramanujan Graphs of Every Degree
From MaRDI portal
Recommendations
- Explicit near-Ramanujan graphs of every degree
- scientific article; zbMATH DE number 1376670
- Ramanujan graphs and Ramanujan hypergraphs
- Ramanujan graphs
- scientific article; zbMATH DE number 2042680
- scientific article; zbMATH DE number 1210372
- scientific article; zbMATH DE number 772544
- ON CONSTRUCTION OF ALMOST-RAMANUJAN GRAPHS
- On Construction of Almost-Ramanujan Graphs
- Ramanujan graphs and digraphs
Cites work
- scientific article; zbMATH DE number 4165188 (Why is no real title available?)
- scientific article; zbMATH DE number 3487716 (Why is no real title available?)
- scientific article; zbMATH DE number 3575812 (Why is no real title available?)
- scientific article; zbMATH DE number 1342092 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 3291152 (Why is no real title available?)
- A combinatorial construction of almost-Ramanujan graphs using the zig-zag product
- A new proof of Friedman's second eigenvalue theorem and its extension to random lifts
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- A proof of Alon’s second eigenvalue conjecture and related problems
- Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions
- Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
- Cubic Ramanujan graphs
- Derandomized constructions of \(k\)-wise (almost) independent permutations
- Eigenvalues and expanders
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- Expander graphs and gaps between primes
- Expander graphs and their applications
- Expanding graphs, Ramanujan graphs, and 1-factor perturbations
- Explicit constructions of linear-sized superconcentrators
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Geometric algorithms and combinatorial optimization.
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Interlacing families. IV: Bipartite Ramanujan graphs of all sizes
- Lifts, discrepancy and nearly optimal spectral gap
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
- On the second eigenvalue of a graph
- Ramanujan graphs
- Ramanujan graphs and Hecke operators
- Random graphs.
- Simple Constructions of Almost k-wise Independent Random Variables
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Some geometric aspects of graphs and their eigenfunctions
- Symmetric groups and expander graphs.
- THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
- The Moore bound for irregular graphs
- The asymptotic number of labeled graphs with given degree sequences
- The eigenvalues of random symmetric matrices
- The non-backtracking spectrum of the universal cover of a graph
- The threshold for SDP-refutation of random regular NAE-3SAT
Cited in
(7)- Cutoff for Ramanujan graphs via degree inflation
- Gap preserving reductions between reconfiguration problems
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Combinatorics via closed orbits: number theoretic Ramanujan graphs are not unique neighbor expanders
- Alphabet reduction for reconfiguration problems
- Optimal PSPACE-hardness of approximating set cover reconfiguration
- Explicit near-Ramanujan graphs of every degree
This page was built for publication: Explicit Near-Ramanujan Graphs of Every Degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5856148)
