Tuesday February 21st at 2.30pm

simple examples, we introduce more advanced techniques, including martingale concentration inequalities. An application to counting

sumsets is given - these are sets of the form

This is related to the Cameron-Erdos Conjecture (1990) on counting sum-free sets, which was recently completely solved by Ben Green.

Using some Fourier analysis and some purely combinatorial theorems, we present a solution to a conjecture of Erdos (1973) on graphs.

Three open problems are given in conclusion.