On the maximum number of open triangles in graphs with few edges

A three-vertex subset is called an open triangle (OT) if it induces a subgraph with exactly two edges. The problem of finding graphs with maximum number of OTs is considered. It is proved that, in case of sufficiently many vertices, such a graph is unique in the class of graphs with constant difference between the numbers of edges and vertices. Bibliogr. 11.