Counting Sets With Small Sumset, And The Clique Number Of Random Cayley Graphs

B. Green

Published 2003 in Comb.

ABSTRACT

Given a set A⊂ ℤ/Nℤ we may form a Cayley sum graph GA on vertex set ℤ/Nℤ by joining i to j if and only if i+j ∈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 GA is almost surely O(logN). 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 ℤ/Nℤ. Indeed, we also show that the clique number of a random Cayley sum graph on Γ =(ℤ/2ℤ)n is almost surely notO(log |Γ|).

PUBLICATION RECORD

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-11 of 11 references · Page 1 of 1

CITED BY

Showing 1-66 of 66 citing papers · Page 1 of 1