On subgraphs of random Cayley sum graphs

Sergei Konyagin; Ilya D. Shkredov

On subgraphs of random Cayley sum graphs

Combinatorics 2017-10-24 v2 Number Theory

Authors: Sergei Konyagin , Ilya D. Shkredov

Abstract

We prove that asymptotically almost surely, the random Cayley sum graph over a finite abelian group $G$ has edge density close to the expected one on every induced subgraph of size at least $\log^c |G|$ , for any fixed $c > 1$ and $|G|$ large enough.

Keywords

cayley graphs random graphs additive combinatorics

Cite

@article{arxiv.1710.07230,
  title  = {On subgraphs of random Cayley sum graphs},
  author = {Sergei Konyagin and Ilya D. Shkredov},
  journal= {arXiv preprint arXiv:1710.07230},
  year   = {2017}
}

Comments

21 pages

Related papers

View all related →