Nearly balanced spanning subdivisions in dense digraphs

Pavez-Signé [Combin. Probab. Comput. 33 (2024), 121–128] conjectured a Dirac-type condition for spanning $H$-subdivisions and asked whether the subdivision paths can additionally be required to have similar lengths. Lee [European J. Combin. 124 (2025), 104059] resolved the existence conjecture in the stronger setting of digraphs. We answer the length-control question in this stronger directed setting: for every $\epsilon >0$, there exists a constant $C_0>0$ such that, for every digraph $H$ with $h$ arcs and no isolated vertices, every $n$-vertex digraph $D$ with $n\ge C_{0}h$ and ${\delta }^0(D)\ge (1\mathrm{/}2+\epsilon )n$ contains a spanning $H$-subdivision whose subdivision paths have lengths differing by at most one.