Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles

Xujin Chen, Zhuo Diao, Xiaodong Hu +1

Given a simple graph $G=(V,E)$, a subset of $E$ is called a triangle cover if it intersects each triangle of $G$. Let ${\nu }_t(G)$ and ${\tau }_t(G)$ denote the maximum number of pairwise ed…