 Triangle lower bound one edge above the Mantel threshold

Every graph on $2n$ vertices with at least $n^2+1$ edges contains at least $n$ triangles. An induction deletes the endpoints of an edge lying in no triangle; if every edge lies in a triangle, the edge-triangle incidence bound is already sufficient.