Jian Wang

Stability for Helly-type and triangle-free families

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 sa...