We may use Tutte maximal matching theorem (in Berge's form) instead of Edmonds matching polytope theorem, as in the proof by Sam Fiorini provided by Tony Huynh. 

Denote by $n, m$ the number of vertices and arcs respectively. Let a maximal matching cover all vertices but $t$, that is, its size equals $(n-t)/2$. Then, by [Tutte--Berge][1] there exists a set $S$ of
vertices such that $G^\ast-S$ has at least $|S|+t$ components $C_1,\ldots,C_{k}$, $k\geqslant |S|+t$ (there exist $|S|+t$ odd components, but we only need so many non-empty components.) Each component $C_i$ contains a vertex $v_i$ from which there is no arc inside $C_i$ (otherwise we have a cycle). All arcs from $v_1,\ldots,v_k$ go to $S$, and since indegrees in $S$ do not exceed 2, we conclude that there exist at most $2|S|$ arcs going from $v_i$'s, and at most $2$ arcs from each of $n-k$ other vertices, in total at most $2(n-k+|S|)\le 2(n-t)$ arcs. Thus, $m/4\leqslant (n-t)/2$, as needed.


  [1]: https://en.wikipedia.org/wiki/Tutte%E2%80%93Berge_formula