Reveals the maximum open triangles in graphs with a fixed edge-vertex difference, indicating structural properties.
In an undirected graph, a 3-vertex induced subgraph having exactly 2 edges is called an open triangle (OT). We consider the class of graphs where the difference between the numbers of edges and vertices is a fixed constant c . The complete characterization of graphs on at least $$ c+7 $$ vertices with the maximum number of OTs is obtained for this class.
No takes yet. Share an insight, caveat, or question.
A. V. Pyatkin (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: