科研之友
微信
新浪微博
Facebook
分享链接
摘要
We consider the problem of minimizing the number of triangles in a graph of given order and size, and describe the asymptotic structure of extremal graphs. This is achieved by characterizing the set of flag algebra homomorphisms that minimize the triangle density.
- 出版日期2017-1
