Return to Colloquia & Seminar listing
A probabalistic version of Szemeredi's regularity lemma
Student-Run Discrete Math Seminar| Speaker: | Ben Fineman, UC Davis |
| Location: | 2112 MSB |
| Start time: | Thu, Mar 4 2010, 12:10PM |
Roughly speaking, Szemeredi's Regularity Lemma, allows one to approximate any graph by simpler objects with uniform behavior. I will talk about the generalization of this lemma to hypergraphs, and the probabalistic tools needed to do so.