Wednesday, July 2, 2014 3:30 pm
-
3:30 pm
EDT (GMT -04:00)
Packing and Covering Small Cliques
Speaker: | Michael Szestopalow |
---|---|
Affiliation: | University of Waterloo |
Room: | Mathematics 3 (M3) 2134 |
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.