Mathematics – Combinatorics
Scientific paper
2003-04-14
Mathematics
Combinatorics
18 pages; to appear in Combinatorica, exposition has been improved thanks to comments from Imre Ruzsa and Seva Lev
Scientific paper
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(log N). This shows that Cayley sum graphs can furnish good examples of Ramsey graphs. To prove this result we must study the specific structure of set addition on Z/NZ. Indeed, we also show that the clique number of a random Cayley sum graph on (Z/2Z)^n, 2^n = N, is almost surely not O(log N). Despite the graph-theoretical title, this is a paper in number theory. Our main results are essentially estimates for the number of sets A in {1,...,N} with |A| = k and |A + A| = m, for various values of k and m.
No associations
LandOfFree
Counting sets with small sumset, and the clique number of random Cayley graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Counting sets with small sumset, and the clique number of random Cayley graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting sets with small sumset, and the clique number of random Cayley graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-478196