Spanning Subdivisions in Robustly Expanding Digraphs

Abstract

Kühn, Osthus and Treglown [\emph{J. Combin. Theory Ser. B} \textbf{100} (2010)] proved that every sufficiently large robust outexpander with linear minimum semi-degree contains a Hamilton cycle. In this paper, we extend their result to spanning subdivisions of a digraph $F$ in a robust outexpander $D$, with prescribed branch vertices and arbitrarily specified path lengths. In particular, the digraph $F$ need not be fixed. For an $n$-vertex digraph $D$, $F$ may have as many as a constant multiple of $n/\log n$ arcs. This holds provided that $F$ has sufficiently few vertices and the prescribed lengths satisfy suitable conditions. We further establish a more general result for mixed prescribed path lengths, which allows $F$ to have linearly many arcs when the shorter replacement paths together use only a small proportion of the vertices of $D$. As applications, we obtain spanning subdivision extensions of the asymptotic Nash--Williams theorem for digraphs and an asymptotically sharp Ore-type theorem for oriented graphs.

arXiv comment16 pages, 3 figures