Quasirandom Cayley graphs
Discrete analysis (2017)
Cet article a éte moissonné depuis la source Scholastica
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ödl, 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.
@article{DAS_2017_a14,
author = {David Conlon and Yufei Zhao},
title = {Quasirandom {Cayley} graphs},
journal = {Discrete analysis},
year = {2017},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DAS_2017_a14/}
}
David Conlon; Yufei Zhao. Quasirandom Cayley graphs. Discrete analysis (2017). http://geodesic.mathdoc.fr/item/DAS_2017_a14/