UAH

The Regularity Lemma and Applications

Dr. Ryan Martin

Department of Mathematics
Carnegie Mellon University


February 21, 2003

202 Madison Hall
2:00 PM (Coffee and Cookies at 1:30)

Abstract

We will discuss Szermérdi's powerful Regularity Lemma, which has proven to be a powerful tool in graph theory, particularly with regards to questions of vertex-packing. We will also discuss applications of this lemma in number theory, geometry, and, of course, extremal graph theory.