On the Exact Tur\'an Number of $F^-_{4,3}$
For a $3$-graph $F$, the Tur\'an number of $F$, denoted by $\ex(n,F)$, is the maximum number of edges in a $3$-graph on $n$ vertices containing no subgraph isomorphic to $F$. Let $F^-_{4,3}$ be the $3$-graph formed by a complete four-vertex core and three outer vertices, with all but one of the twelve triples containin...