On the Codegree Density of $PG_m(q)$

For an $r$-graph $G$, the minimum $(r-1)$-degree $\delta(G)$ is the largest integer $t$ such that every $(r-1)$-subset of $V(G)$ is contained in at least $t$ edges of $G$. Given an $r$-graph $F$, t...