Let $G$ be a graph on $n$ vertices, ${\alpha }_1(G)$ be the maximum number of edges that contain at most one edge from every triangle, and ${\tau }_1(G)$ be the minimum number of edges that contain at least one edge from every triangle.Is it true that$${\alpha }_1(G)+{\tau }_1(G)\le \frac{n^2}{4}?$$