[an error occurred while processing this directive]
An error occured whilst processing this directive
Regular Partitions
School of Informatics
U. of Edinburgh
4pm Tuesday 7th of October, 2008
Room 4.31/4.33, Informatics Forum
Abstract
A combinatorial object (e.g., a graph, a hypergraph, or a 0/1 matrix) is
called quasi-random if its global structure resembles that of a random
object of the same density. Moreover, a regular partition is an
approximation of a huge object by a small number of quasi-random objects.
Regular partitions are a crucial tool in combinatorics, where the goal is to
prove theorems about discrete structures. In this talk I will present
algorithmic applications of (various types of) regular partitions.
An error occured whilst processing this directive