|Time:|| 12:00 - 13:20
Scaife Hall 219
Department of Mathematical Sciences
Carnegie Mellon University
The Regularity Lemma III: Measure theory and regularity.
|Abstract:||Szemeredi's Regularity Lemma is a basic result in finite combinatorics. In a series of lectures I will outline a proof of this result which uses ideas from logic, and is due to Elek and Szegedy. No background in either logic or combinatorics will be assumed. In the third lecture we use measure theory in the context of an ultrapower of finite sets to prove a version of Regularity.|