MATH Seminar

Title: Extremal problems for random discrete structures
Colloquium: Combinatorics
Speaker: Mathias Schacht of University Hamburg
Contact: Vojtech Rodl, rodl@mathcs.emory.edu
Date: 2010-03-16 at 4:00PM
Venue: MSC W301
Download Flyer
Abstract:
We study thresholds for extremal properties of random discrete structures. We determine the threshold for Szemeredi’s theorem on arithmetic progressions in random subsets of the integers and its multidimensional extensions and we determine the threshold for Turan-type problems for random graphs and hypergraphs. In particular, we verify a conjecture of Kohayakawa, Luczak, and Rodl for Turan-type problems in random graphs. Similar results were obtained by Conlon and Gowers.

See All Seminars