Hypergraph Turán problem of the generalized triangle with bounded matching number

Jian Wang, Wenbin Wang, Weihua Yang

Let $\mathcal{H}$ be a 3-graph on $n$ vertices. The matching number $\hat{I}½(\mathcal{H})$ is defined as the maximum number of disjoint edges in $\mathcal{H}$. The generalized triangle…