Next: Santosh Kabadi - Delta-matroid Up: Discrete Mathematics / Mathématiques Previous: Bert Hartnell - The
Penny Haxell - Packing and covering triangles in dense graphs
| PENNY HAXELL, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada | |
| Packing and covering triangles in dense graphs |
For a graph G, let 
denote the maximum size of a set of
pairwise edge-disjoint triangles in G, and 
denote the
minimum size of a set of edges C of G such that every triangle of
G contains an edge from C. A conjecture of Tuza states that
for every graph G. Some results on this
conjecture will be presented, in particular that it is approximately
true for dense graphs.
eo@camel.math.ca
