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: | Green, B |
---|---|
Format: | Journal article |
Published: |
2003
|
Similar Items
-
Counting sets with small sumset and applications
by: Green, B, et al.
Published: (2013) -
Sets with small sumset and rectification
by: Green, B, et al.
Published: (2004) -
On the chromatic number of random Cayley graphs
by: Green, B
Published: (2016) -
Sumsets and entropy revisited
by: Green, B, et al.
Published: (2024) -
on the number of cliques and cycles in graphs
by: Mojgan Emami, et al.
Published: (2013-06-01)