2 problems

Triangle-count conjecture. If

Let $G$ be an $n$-vertex graph, let $T(G)$ denote its number of triangles, and let $\tau_{\triangle}(G)$ be the minimum size of a vertex set meeting every triangle. For integers…