{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T15:25:56Z","timestamp":1787325956153,"version":"build-2736575974"},"reference-count":9,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2015,1]]},"abstract":"<jats:p>For a given multigraph $H$, a graph $G$ is $H$-linked if $|G|\\ge |H|$ and for every injective map $\\tau: V(H)\\to V(G)$, we can find internally disjoint paths in $G$, such that every edge from $uv$ in $H$ corresponds to a $\\tau(u)-\\tau(v)$ path. To guarantee that a $G$ is $H$-linked, you need a minimum degree larger than $\\frac{|G|}{2}$. This situation changes, if you know that $G$ has a certain connectivity $k$. Depending on $k$, even a minimum degree independent of $|G|$ may suffice. Let $\\delta(k,H,N)$ be the minimum number such that every $k$-connected graph $G$ with $|G|=N$ and $\\delta(G)\\ge \\delta(k,H,N)$ is $H$-linked. We study bounds for this quantity. In particular, we find bounds for all multigraphs $H$ with at most three edges and some with four edges, which are optimal up to small additive or multiplicative constants. As a consequence, we also establish a few pure connectivity bounds for graph linkages.<\/jats:p>","DOI":"10.1137\/140974419","type":"journal-article","created":{"date-parts":[[2015,4,2]],"date-time":"2015-04-02T13:56:21Z","timestamp":1427982981000},"page":"716-729","source":"Crossref","is-referenced-by-count":0,"title":["Combined Degree and Connectivity Conditions for $H$-Linked Graphs"],"prefix":"10.1137","volume":"29","author":[{"given":"Florian","family":"Pfender","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2015,4,2]]},"reference":[{"key":"atypb1","unstructured":"R. Diestel,\n                      Graph Theory\n                      , Springer-Verlag, New York, 1997."},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-2.1.69"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20612"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01350174"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548305007479"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20362"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2004.02.013"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2007.11.008"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1007\/s00026-003-0183-1"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/140974419","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:24:46Z","timestamp":1787322286000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/140974419"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["10.1137\/140974419"],"URL":"https:\/\/doi.org\/10.1137\/140974419","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}