Quasirandom Cayley graphs

Quasirandom Cayley graphs
复制标题

拟随机凯莱图

DOI:
10.19086/da.1294
复制
发表时间:
2016
期刊:
arXiv: Combinatorics
影响因子:
--
通讯作者:
Yufei Zhao
Yufei Zhao
中科院分区:
--
文献类型:
--
作者:
D. Conlon;Yufei Zhao

文献摘要

被引文献

相似文献

我们证明,在Cayley图中具有较小的差异和少量特征值的特性相当于Kohayakawa,R \“ ODL和Schacht的结果,他们处理了Abelian案件。 ,我们还证明了所有顶点传输图中的类似结果。
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.