Graph theory seminar - Michael Szestopalow

Packing and Covering Small Cliques

Abstract: 

A long-standing conjecture of Zsolt Tuza states that if a graph contains at most k pairwise edge-disjoint triangles, then it also contains a set of at most 2k edges whose deletion creates a triangle free graph. We will highlight some of the known (and unknown) results related to this conjecture.