Triple systems with bounded matching number: some constructions and exact Turán number

We study the Turán numbers of $3$-graphs avoiding $3$-graphs $F$ and $M_{s+1}^3$, a matching of size $s+1$. We disprove a conjecture of Gerbner, Tompkins, and Zhou [European Journal of Combinatorics, 2025, 127:104155] on $\text{ex}(n,\{F,M_{s+1}^3\})$ for $3$-graph $F$ with $\chi (F)=2$ by constructing infinitely many counterexamples. For this family, we determine the asymptotic Turán number via edge-colored Turán problem. In addition, for the $3$-graph $F_{3,2}$ with edge set $\{123,145,245,345\}$, we determine the exact value of $\text{ex}(n,\{F_{3,2},M_{s+1}^3\})$ for every integers $s$ and all $n\ge 12s^2$.