Stability for Helly-type and triangle-free families

Abstract: We consider $k$-graphs, $\mathcal{F}\subset \binom{[n]}{k}$, $k\geq 3$. A $k$-graph is called intersecting if any two of its edges have non-empty intersection. It is called a star if all its edges share a common vertex. The $k$-graph $\mathcal{F}$ is called Helly if all its intersecting subfamilies are stars. If the same is required only for subfamilies consisting of three edges, it is called triangle-free. It is well known that for $n\geq 3k/2$, the full star is the unique largest triangle-free family whence the largest Helly family as well. In 1984 Tuza proved the best possible bound $$|\mathcal{F}|\leq \binom{n-k-1}{k-1}+\binom{n-2}{k-2}+1$$ for Helly families that are not stars, albeit only for some unspecified $n&gt;n_0(k)$. The aim of this paper is twofold. First we establish the same bound for $n&gt;2k$. Second we show that for $n&gt;12k<sup>2$ the same upper bound holds for triangle-free families. It is shown as well that it is not true for $2k&lt;n\leq 3k-4$.