Extremal Problems for the Family of $k$-Strongly Connected Digraphs

Qinglin Wang, Yingzhi Tian

Let $\mathcal{D}$ be a family of digraphs. A digraph $D$ is \emph{$\mathcal{D}$-saturated} if it contains no member of $\mathcal{D}$ as a subdigraph, but for any arc $e$ in the com…