Counting sets with small sumset, and the clique number of random Cayley graphs
Given a set A in Z/NZ we may form a Cayley sum graph G_A on vertex set Z/NZ by joining i to j if and only if i + j is in A. We investigate the extent to which performing this construction with a random set A simulates the generation of a random graph, proving that the clique number of G_A is a.s. O(...
Main Author: | |
---|---|
Format: | Journal article |
Published: |
2003
|