6
Dec
Speaker: Páll Melsted
Time: Thu, Dec 7th, 4:30
Place: PPB 300
Title: Graph Limits
Abstract:In their paper Limits of Dense Graph Sequences, Lovász and Szegedy show that for a sequence of dense graphs G_1,G_2,… , where the subgraph density t(F,G_n) converges for every fixed graph F, has a limit object.
A metric for all simple graphs is given and extended to measurable function on the unit square. With this metric space we can rephrase Szemerédi’s Lemma in a neat way and other problems become questions of convergence or continuity.
The talk will be an overview of these methods and should be accessible to the audience.
