A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Given a (multi)digraph H, a digraph D is H-linked if every injective function ι : V (H) → V (D) can be extended to an H-subdivision. In this paper, we give sharp degree conditions that assure a sufficiently large digraph D is H-linked for arbitrary H. The notion of an H-linked digraph extends the classes of m-linked, m-ordered and strongly m-connected digraphs. First, we give sharp minimum semi-degree conditions for H-linkedness, extending results of Kühn and Osthus on m-linked and m-ordereddoi:10.1017/s0963548313000278 fatcat:kab4kbgouvcjzb5wx4gj44yy4e