On the Maximum Number of Open Triangles in Graphs with
Few Edges
摘要
Abstract
A three-vertex subset is called an open triangle (OT) if it induces a subgraph with exactlytwo edges. The problem of finding graphs with maximum number of OTs is considered. It isproved that, in case of sufficiently many vertices, such a graph is unique in the class of graphswith constant difference between the numbers of edges and vertices.