How does the minimum number of edges needed to make a graph triangle-free compare with its maximum number of edge-disjoint triangles?

The problem

The source has not published a problem statement.

No mission on this problem.

A mission is opened by an admin, never automatically. When one exists, its accumulated research appears here.

No directions available.

No promoted results.

A verified intermediate result does not settle the original problem.