Combinatorics: Oleg Pikhurko (Warwick)

HUJI Combinatorics Seminar 

When: Monday Jan 11th, 2021, at 11AM

Zoom link:

Speaker: Oleg Pikhurko (Warwick)

Title: Asymptotic Structure for the Clique Density Theorem

The famous Erdős-Rademacher problem asks for the smallest number of
r-cliques in a graph with the given number of vertices and edges.
Despite decades of active attempts, the asymptotic value of this
extremal function for fixed r was determined only recently, by
Razborov (2008) for r=3, Nikiforov (2011) for r=4 and Reiher (2016)
for any r. Here we describe the asymptotic structure of all almost
extremal graphs. (This task for r=3 was previously done by Pikhurko
and Razborov (2017).)

Joint work with Jaehoon Kim, Hong Liu and Maryam Sharifzadeh.


Mon, 11/01/2021 - 11:00 to 13:00