A famous conjecture of Tuza from 1981 asserts that if the maximum number of edge-disjoint triangles in a graph G is k, then there exist 2k edges whose removal makes G triangle-free.  We discuss a generalization of this conjecture to all uniform hypergraphs, and several new bounds on the generalized conjecture.

The talk is based on several joint works with Aharoni, Basit, McGinnis, Simmons, Sinnwell, Bennett and Dudek.