No label defined (Q4946545)

Let \(D\) be a minimally \(k\)-edge-connected simple digraph and \(|D|\) the number of vertices in \(D\). Suppose \(u\) denotes the number of vertices in \(D\) with outdegree equal to \(k\) and indegree greater than \(k\), \(v\) the number of vertices in \(D\) with both outdegree and indegree equal to \(k\), and \(w\) the number of vertices in \(D\) with the outdegree greater than \(k\) and indegree equal to \(k\). The authors prove that if \(|D|\geq 2k-2\) then, \[ u+2v+ w\geq \begin{cases} (2|D|+ 4k^2+ 4)/3k+ 2,\quad &\text{for }k\geq 6,\\ (|D|+ 24)/7,\quad &\text{for }k= 4,\\ (2|D|+ 80)/17,\quad &\text{for }k= 5.\end{cases} \] {}.