Simonovits's Theorem in Random Graphs

Explore a 57-minute lecture by Wojciech Samotij, an associate professor at Tel Aviv University's School of Mathematical Sciences, on Simonovits's theorem in random graphs. Delve into the world of extremal and probabilistic combinatorics as presented by this accomplished mathematician, recipient of numerous prestigious awards including the George Pólya Prize in Combinatorics and the European Prize in Combinatorics. Gain insights from Samotij's expertise, shaped by his experiences at the University of Illinois at Urbana-Champaign, Trinity College, Cambridge, and his current role at Tel Aviv University. Discover how his recent work on the theory of large deviations intersects with the main topic of this BIMSA-hosted talk.

Wojciech Samotij: Simonovits's theorem in random graphs