Asymptotic Structure of Graphs with the Minimum Number of Triangles
  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. 
Oleg Pikhurko and Alexander Razborov
math.CO