Randomly perturbed digraphs also have bounded-degree spanning trees

Patryk Morawski, Kalina Petrova

We show that a randomly perturbed digraph, where we start with a dense digraph $D_{\alpha }$ and add a small number of random edges to it, will typically contain a fixed orientation of a b…