On the number of triangles in $K_4$-free graphs

Jialin He, Jie Ma, Yan Wang +1

Erdős asked whether for any $n$-vertex graph $G$, the parameter $p^{\ast }(G)=\min {\sum }_{i\ge 1}(|V(G_i)|-1)$ is at most $\lfloor n^2/4\rfloor$, where the minimum is taken over all edge…