Definition. Let $X$ be a set of size $n$ and let $G$ be a set of graphs with vertex set $X$. Then $G$ is $\mathrm{\Delta }$-intersecting (read as “triangle-intersecting”) if for all $G_1,G_2\in G$, $G_1\cap G_2$ contains a triangle.