Keynote speakers

• Miklós Abért (Rényi Institute, Hungary): Groups and graph limits
• Zdeněk Dvořák (Charles University, Czech Republic): Old and new structure theorems and their applications
• Stephan Kreutzer (TU Berlin, Germany) : Model checking on sparse graphs, and Stability in graphs
• Patrice Ossona de Mendez (CAMS CNRS Paris, France): Structural limits
• Szymon Toruńczyk (University of Warsaw, Poland) : Computation with atoms (slides: part 1, part 2)

Contributed talks

• Mirna Džamonja (University of East Anglia, UK): Logical perspectives of graphons
• Taísa Martins (University of Warwick, UK): Graph limits - finite forcibility and computability
• Michał Pilipczuk (University of Warsaw, Poland): Definability equals recognizability for graphs of bounded treewidth
• Sebastian Siebertz (University of Warsaw, Poland): Neighbourhood complexity and almost linear kernels for distance-r domination on nowhere dense classes of graphs

Problems presented during the open problem session

Funding info

The workshop was organized by Mathematics Research Centre (MRC) of Warwick Mathematics Institute. It was supported by the Leverhulme Trust 2014 Philip Leverhulme Prize with additional support coming from the Centre for Discrete Mathematics and its Applications (DIMAP) and the grant LADIST of the European Research Council (ERC).