On Large Semi-Linked GraphsDiscrete Mathematics
AbstractLet H be a multigraph, possibly with loops, and consider a set S⊆V(H). A (simple) graph G is (H,S)-semi-linked if, for every injective map f:S→V(G), there exists an injective map g:V(H)∖S→V(G)∖f(S) and a set of |E(H)| internally disjoint paths inG connecting pairs of vertices of f(S)∪g(V(H)∖S) for every edge between the corresponding vertices of H. This new concept of (H,S)-semi-linkedness is a generalization of H-linkedness . We establish a sharp minimum degree condition for a sufficiently large graph G to be (H,S)-semi-linked.
Citation InformationAlexander Halperin, Colton Magnant and Hua Wang. "On Large Semi-Linked Graphs" Discrete Mathematics Vol. 338 Iss. 1 (2015) p. 122 - 129
Available at: http://works.bepress.com/colton_magnant/42/