Abstract:Tuza famously conjectured in 1981 that in a graph without k+1 edge-disjoint
triangles, it suffices to delete at most 2k edges to obtain a triangle-free
graph. The conjecture holds for graphs with small treewidth or small maximum
average degree, including planar graphs. However, for dense graphs that are
neither cliques nor 4-colorable, only asymptotic results are known. Here, we
confirm the conjecture for threshold graphs, i.e. graphs that are both split
graphs and cographs, and for co-chain graphs with both s… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.