1 problem

Let $F_5$ denote the 3-uniform hypergraph in the paper, let $M_{s+1}^3$ denote a matching of size $s+1$, and let ${\rm ex}_3(n,\{F_5,M_{s+1}^3\})$ be the maximum number of edges in…