Extremal combinatorics for sparse (pseudo)random structures

Combinatorics Seminar
Friday, November 1, 2013 - 3:00pm
1 hour (actually 50 minutes)
Skiles 005
Emory University and University of Sao Paulo
The problem of extending results in extremal combinatorics to sparse random and pseudorandom structures has attracted the attention of many researchers in the last decades. The breakthroughs due to several groups in the last few years have led to a better understanding of the subject, however, many questions remain unsolved. After a short introduction into this field we shall focus on some results in extremal (hyper)graph theory and additive combinatorics. Along the way some open problems will be given.