Seminar series
Date
Tue, 26 Feb 2019
Time
14:30 -
15:30
Location
L6
Speaker
Maryam Sharifzadeh
Further Information
Among all graphs of given order and size, we determine the asymptotic structure of graphs which minimise the number of $r$-cliques, for each fixed $r$. In fact, this is achieved by characterising all graphons with given density which minimise the $K_r$-density. The case $r=3$ was proved in 2016 by Pikhurko and Razborov.
This is joint work with H. Liu, J. Kim, and O. Pikhurko.