The first and most substantial concerns partition regularity.  It is a coherent presentation of all of the material from Partition regularity in the rationals, Partition regularity with congruence conditions and Partition regularity of a system of De and Hindman.

The remaining three chapters are expanded versions of Maximum hitting for sufficiently large, Random walks on quasirandom graphs and A note on balanced independent sets in the cube.¹

Erratum: the form of Talagrand’s inequality quoted as Theorem 6 in Chapter 4 has an incorrect proof in the book cited.  The proof can be modified to prove a slightly weaker result, with 60 replaced by 90 and an assumption that the median of is at least (a constant).  This is remarked in the published version of this chapter, Random walks on quasirandom graphs.

¹ “A note … ” was fairly described by one of my examiners as a “potboiler”.  It was also my first submitted paper, and completed in my second of three years.  Perhaps this will reassure anybody in the first year of a PhD who is worrying that they have yet to publish.

How large can an independent set in the discrete cube be if it contains equal numbers of sets of even and odd size? Take odd sets starting from the bottom of the cube, and even sets starting from the top. Proving that this works uses an isoperimetric inequality: if you know the proof of Harper’s theorem that uses codimension 1 compressions then you know how to prove the inequality that’s quoted without proof in this paper.