# How many edges are needed if at least there is an edge among any 3 vertices?

In a simple graph, how many edges are needed if at least there is an edge among any 3 vertices?

If a graph has at least one edge among any $3$ vertices, then the complementary graph contains no triangle, and vice versa. What is the most edges an $n$-vertex (simple) graph can have without containing a triangle? [*] Subtract from $\binom n2$.