Quasirandom Cayley graphs
From MaRDI portal
Publication:4645011
DOI10.19086/da.1294zbMath1404.05190arXiv1603.03025OpenAlexW2293971275WikidataQ105468643 ScholiaQ105468643MaRDI QIDQ4645011
Publication date: 9 January 2019
Published in: Discrete Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.03025
Random graphs (graph-theoretic aspects) (05C80) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Failure of the trilinear operator space Grothendieck theorem, Eigenvalues of Cayley graphs, Linear quasi-randomness of subsets of abelian groups and hypergraphs, Outlaw distributions and locally decodable codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lifts, discrepancy and nearly optimal spectral gap
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- A new upper bound for the complex Grothendieck constant
- Ramanujan graphs
- Sparse quasi-random graphs
- Hermitian matrices and graphs: Singular values and discrepancy
- Discrepancy and eigenvalues of Cayley graphs
- Grothendieck-Type Inequalities in Combinatorial Optimization
- Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
- Expander graphs and their applications
- Quasirandom Groups
- Grothendieck’s Theorem, past and present
- THE GROTHENDIECK CONSTANT IS STRICTLY SMALLER THAN KRIVINE’S BOUND
- Absolutely summing operators in $ℒ_{p}$-spaces and their applications
- Quasi-random graphs