Locally common graphs

Endre Csóka, Tamás Hubai, László Lovász

Goodman proved that the sum of the number of triangles in a graph on $n$ nodes and its complement is at least $n^3/24$; in other words, this sum is minimized, asymptotically, by a…