University of Warwick刘鸿博士学术报告
报告人：刘鸿博士，University of Warwick
报告题目：The minimum number of triangles in graphs of given order and size
报告摘要： In 1941 Rademacher raised the question of determining the minimum number of triangles in a graph of given order and size. This problem has attracted much attention and, in a major breakthrough, was solved asymptotically by Razborov in 2008.
In this paper, we provide an exact solution for all large graphs whose edge density is bounded away from~$1$, confirming a conjecture of Lov\'asz and Simonovits from 1975 in this range. Furthermore, we give a description of extremal graphs.
Joint work with Oleg Pikhurko and Katherine Staden