Extremal number conjecture for matching blow-ups of complete bipartite graphs

Let $K_{s,t}$ be the complete bipartite graph with $s\leq t$, let $p\geq 3$, and let $\mathcal{M}(K^{p+1}_{s,t})$ denote the matching blow-up family used in the paper. Let $h(n,1,s)$ and $f(t-1,t-1)$ be the functions defined in the paper. Matching blow-up extremal-number conjecture. If $n\geq s+2t$ and $p\geq 3$, then

$$\emph{ex}(n,\mathcal{M}(K^{p+1}_{s,t}))=h(n,1,s)+f(t-1,t-1)-\left\lceil\frac{s-1}{2}\right\rceil+i,$$

where $i=1$ if $s=t$ is even and $i=0$ otherwise. The conjecture concerns the exact extremal number for the matching blow-up of $K_{s,t}$, which the paper does not determine in its theorem; its resolution is not supplied here.