 Edge-disjoint triangles

A family of triangles in a graph is edge-disjoint if no edge belongs to two members. Any deletion of edges producing a triangle-free graph must remove at least one distinct edge for each member. The triangles in a graph may share vertices.