The Regularity Lemma states roughly that the vertices of any large enough graph can be split up into pieces so that the bipartite graph spanned by the edges between each pair of pieces behaves essentially like a random bipartite graph. Thus, it seems reasonable that the resultant structure is amenable to analysis via the semi-random method. The most ambitious goal of the workshop is to foster collaborative research projects which combine the Regularity Lemma and the semi-random method. However, the presentations given at the workshop will not be so narrowly focussed. There will be no contributed talks.
Limited funds are available to support participants.