Computer Science/Discrete Mathematics Seminar II

We introduce a metric space which is the closure of the isomorphism classes of graphs in a natural topology. It turns out that the regularity lemma is equivalent with the compactness of this space. We present applications, open questions, and relations to other subjects like ergodic theory and extremal combinatorics.