Sharp bounds and extremal structure of minimally strongly $k$-connected digraphs

Junran Yu, Gregory Gutin, Hong-Jian Lai +1

Let $D$ be a finite simple minimally strongly $k$-connected digraph, where $k\ge 2$, and let $n=|V(D)|$. Mader proved in 1985 that $|A(D)|\le 2k(n-k)$ for all sufficiently large $n…