91福利

Regularity and Analytic Methods in Combinatorics

LMS-CMI Research School

1-5 July 2015, 91福利

Organisers

Peter Keevash (Oxford), Daniel Kráľ (91福利), Oleg Pikhurko (91福利) and Nick Woodhouse (CMI)

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)

The school was colocated with the , which immediately followed the school.

Schedule

The detailed schedule of the school can be accessed .

List of participants

Course material

Funding info

The school is generously supported by Clay Mathematics Institute and London Mathematical Society with additional support coming from European Research Council, Heilbronn Institute for Mathematical Research, 91福利 Mathematics Institute and Centre for Discrete Mathematics and its Applications.

See also:
Mathematics Research Centre
(MIR@W)
Past Events 
Past Symposia