Seminar series
Date
Mon, 01 Dec 2008
Time
16:00 -
17:00
Location
SR1
Speaker
Sebastian Pancratz
Organisation
University of Oxford
This talk will give detailed proofs of Szemer\'{e}di's Regularity Lemma for graphs and the deduction of Roth's Theorem. One can derive Szemer\'{e}di's Theorem on arithmetic progressions of length $k$ from a suitable regularity result on $(k-1)$-uniform hypergraphs, and this will be introduced, although not in detail.