# Hong Liu gave a talk describing approximate structures of an n-vertex m-edge graph minimizing the number of cliques of size k at the Discrete Math Seminar

On May 26, 2020, Hong Liu from University of Warwick presented a talk on his recent work describing approximate structures of an n-vertex m-edge graph minimizing the number of cliques of size k. The title of his talk was “Asymptotic Structure for the Clique Density Theorem”.