Packing and covering triangles in graphs
β
P.E. Haxell
π
Article
π
1999
π
Elsevier Science
π
English
β 184 KB
It is shown that if G is a graph such that the maximum size of a set of pairwise edge-disjoint triangles is v(G), then there is a set C of edges of G of size at most (3 -e)v(G) such that E(T) N C 7~ 0 for every triangle T of G, where e> 3. This is the first nontrivial bound known for a long-standing