| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903596 | European Journal of Combinatorics | 2018 | 14 Pages |
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 logc|G|, for any fixed c>1 and |G| large enough.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
S.V. Konyagin, I.D. Shkredov,