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

Abstract

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 $F_5$ is a 3-graph on the vertex set $\{a,b,c,d,e\}$ with the edge set $\{abc,abd,cde\}$. In this paper, we showed that an $F_5$-free 3-graph $\mathcal{H}$ with matching number at most $s$ has at most $s\lfloor (n-s{)}^2/4\rfloor$ edges for $n\ge 30(s+1)$ and $s\ge 3$. For the proof, we establish a 2-colored version of Mantel's theorem, which may be of independent interests.

A corollary is added