Another Extremal Property of Some Turan Graphs

An inequality relating the size and order of a simple graph to the average number of triangles containing a fixed edge is proven. It is shown that the only graphs for which equality holds in this inequality are the Turin graphs with the same number of vertices in each partite set