For a fixed multigraph H with vertices , a graph G is H-linked if for every choice of vertices in G, there exists a subdivision of H in G such that is the branch vertex representing (for all i). This generalizes the notions of -linked, -connected, and -ordered graphs.
Given a connected multigraph H with edges and minimum degree at least two and , we determine the least integer d such that every n-vertex simple graph with minimum degree at least d is H-linked. This value appears to equal the least integer such that every n-vertex graph with minimum degree at least is -connected, where is the maximum number of edges in a bipartite subgraph of H.