Stability results in additive combinatorics and graph theory

Simao Herdade, Rutgers University
Fine Hall 224

We will talk about stability results in extremal combinatorics. Along the way, we solve a question of Erdos and Sarkozy on sumsets of integers avoiding perfect squares, and reprove the Posa-Seymour conjecture on hamiltonian cycles for large graphs. Joint work with A.Jamshed, A. Khalfalah, and E. Szemeredi.