Packing and Covering Small Cliques
|Affiliation:||University of Waterloo|
|Room:||Mathematics 3 (M3) 2134|
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.
200 University Avenue West
Waterloo, ON N2L 3G1