Wojda's conjecture on packing digraphs

Let $D$ and $D'$ be digraphs, and let $|A(D)|$ denote the size of $D$, meaning its number of arcs. For every integer $n$ and every $m$ satisfying

$$2\leq m\leq \frac{n}{2},$$

write $\mu(n,k)$ for the smallest number such that there exist digraphs $D$ and $D'$ of order $n$, with $|A(D)|=k$ and $|A(D')|=\mu(n,k)$, that do not pack. Wojda's conjecture. For every $m$ satisfying $2\leq m\leq \frac{n}{2}$,

$$\mu(n,n-m)=2n-\left\lfloor\frac{n}{m}\right\rfloor.$$

Equivalently, the condition that one digraph has size at most $n-m$ and the other has size less than $2n-\lfloor n/m\rfloor$ guarantees that the two digraphs pack. The paper confirms the conjecture for $m\geq 93$ and $n\geq 31m$; the general statement remains open.