University of Warwick
1-5 July 2015

Course outline

The school covered three interlinked discrete mathematics topics with computer science applications, which all saw exciting developments in the last few years: the Regularity Method, Limits of Combinatorial Structures, and Property Testing.

The three main lecture course topics are:

• Regularity Methods (David Conlon, Oxford)
• Limits of Combinatorial Structures (Christian Borgs and Henry Cohn, Microsoft)
• Property Testing (Asaf Shapira, Tel-Aviv)

These lecture courses were supplemented by tutorial sessions.

The school also included three special more generally focused talks given by:

• Noga Alon (Tel Aviv)
• Christian Borgs (Microsoft)
• Ben Green (Oxford)

Organisers: Peter Keevash (Oxford), Daniel Kráľ (Warwick), Oleg Pikhurko (Warwick) and Nick Woodhouse (CMI)

More information at the school website