Quasirandom Cayley graphs
Combinatorics
2017-03-09 v4 Group Theory
Abstract
We prove that the properties of having small discrepancy and having small second eigenvalue are equivalent in Cayley graphs, extending a result of Kohayakawa, R\"odl, and Schacht, who treated the abelian case. The proof relies on Grothendieck's inequality. As a corollary, we also prove that a similar result holds in all vertex-transitive graphs.
Keywords
Cite
@article{arxiv.1603.03025,
title = {Quasirandom Cayley graphs},
author = {David Conlon and Yufei Zhao},
journal= {arXiv preprint arXiv:1603.03025},
year = {2017}
}
Comments
Reformatted for Discrete Analysis