TY - JOUR
T1 - On a conjecture of Tuza about packing and covering of triangles
AU - Krivelevich, Michael
PY - 1995/7/15
Y1 - 1995/7/15
N2 - Zs. Tuza conjectured that if a simple graph G does not contain more than k pairwise edge disjoint triangles, then there exists a set of at most 2k edges which meets all triangles in G. We prove this conjecture for K3, 3-free graphs (graphs that do not contain a homeomorph of K3, 3). Two fractional versions of the conjecture are also proved.
AB - Zs. Tuza conjectured that if a simple graph G does not contain more than k pairwise edge disjoint triangles, then there exists a set of at most 2k edges which meets all triangles in G. We prove this conjecture for K3, 3-free graphs (graphs that do not contain a homeomorph of K3, 3). Two fractional versions of the conjecture are also proved.
UR - http://www.scopus.com/inward/record.url?scp=0008160172&partnerID=8YFLogxK
U2 - 10.1016/0012-365X(93)00228-W
DO - 10.1016/0012-365X(93)00228-W
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0008160172
SN - 0012-365X
VL - 142
SP - 281
EP - 286
JO - Discrete Mathematics
JF - Discrete Mathematics
IS - 1-3
ER -