{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:17:33Z","timestamp":1760573853929,"version":"build-2065373602"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T00:00:00Z","timestamp":1758240000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T00:00:00Z","timestamp":1758240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2023YFA1010203"],"award-info":[{"award-number":["2023YFA1010203"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071453"],"award-info":[{"award-number":["12071453"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s00373-025-02970-1","type":"journal-article","created":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T13:10:53Z","timestamp":1758287453000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A New Connectivity Bound for a Tournament to be Highly Linked"],"prefix":"10.1007","volume":"41","author":[{"given":"Bin","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7634-0250","authenticated-orcid":false,"given":"Xinmin","family":"Hou","sequence":"additional","affiliation":[]},{"given":"Gexin","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Xinyu","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,19]]},"reference":[{"key":"2970_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0167-5060(08)70447-3","volume":"41","author":"J Bang-Jensen","year":"1989","unstructured":"Bang-Jensen, J.: On the $$2$$-linkage problem for semicomplete digraphs. Ann. Discrete Math. 41, 23\u201338 (1989)","journal-title":"Ann. Discrete Math."},{"key":"2970_CR2","doi-asserted-by":"crossref","unstructured":"Bang-Jensen, J., Johansen, K.S.: Every $$(13k--6)$$-strong tournament with minimum out-degree at least $$28k-13$$ is $$k$$-linked. Discrete Math. 6, 112831 (2022)","DOI":"10.1016\/j.disc.2022.112831"},{"key":"2970_CR3","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF01261316","volume":"16","author":"B Bollob\u00e1s","year":"1996","unstructured":"Bollob\u00e1s, B., Thomason, A.: Highly linked graphs. Combinatorica 16, 313\u2013320 (1996)","journal-title":"Combinatorica"},{"key":"2970_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, London (2008)"},{"issue":"6","key":"2970_CR5","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s00493-021-4374-3","volume":"41","author":"A Gir\u00e3o","year":"2021","unstructured":"Gir\u00e3o, A., Popielarz, K., Snyder, R.: $$(2k+1)$$-connected tournaments with large minimum out-degree are $$k$$-linked. Combinatorica 41(6), 815\u2013837 (2021)","journal-title":"Combinatorica"},{"key":"2970_CR6","first-page":"251","volume":"139","author":"A Gir\u00e3o","year":"2019","unstructured":"Gir\u00e3o, A., Snyder, R.: Highly linked tournaments with large minimum out-degree, j. comb. theory. Ser. B. 139, 251\u2013266 (2019)","journal-title":"Ser. B."},{"key":"2970_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF01350174","volume":"187","author":"HA Jung","year":"1970","unstructured":"Jung, H.A.: Verallgemeinerung des $$n$$-fachen zusammenhangs f\u00fcr graphen. Math. Ann. 187, 95\u2013103 (1970)","journal-title":"Math. Ann."},{"key":"2970_CR8","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1112\/plms\/pdu019","volume":"109","author":"D K\u00fchn","year":"2014","unstructured":"K\u00fchn, D., Lapinskas, D., Osthus, J., Patel, V.: Proof of a conjecture of thomassen on hamilton cycles in highly connected tournaments. Proc. Lond. Math. Soc. 109, 733\u2013762 (2014)","journal-title":"Proc. Lond. Math. Soc."},{"key":"2970_CR9","first-page":"144","volume":"20","author":"DG Larman","year":"1974","unstructured":"Larman, D.G., Mani, P.: On the existence of certain configurations within graphs and the 1-skeletons of polytopes. Proc. Lond. Math. Soc. 20, 144\u2013160 (1974)","journal-title":"Proc. Lond. Math. Soc."},{"key":"2970_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2021.103390","volume":"98","author":"W Meng","year":"2021","unstructured":"Meng, W., Rolek, M., Wang, Y., Yu, G.: An improved linear connectivity bound for tournaments to be highly linked. Eur. J. Comb. 98, 103390 (2021)","journal-title":"Eur. J. Comb."},{"key":"2970_CR11","doi-asserted-by":"publisher","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K Menger","year":"1927","unstructured":"Menger, K.: Zur allgemeinen kurventheorie. Fund. Math. 10, 96\u2013115 (1927)","journal-title":"Fund. Math."},{"issue":"4","key":"2970_CR12","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1215\/S0012-7094-55-02268-7","volume":"22","author":"O Ore","year":"1955","unstructured":"Ore, O.: Graphs and matching theorems. Duke Math. J. 22(4), 625\u2013639 (1955)","journal-title":"Duke Math. J."},{"key":"2970_CR13","first-page":"339","volume":"115","author":"A Pokrovskiy","year":"2015","unstructured":"Pokrovskiy, A.: Highly linked tournaments, j. comb. theory. Ser. B. 115, 339\u2013347 (2015)","journal-title":"Ser. B."},{"key":"2970_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.ejc.2004.02.013","volume":"26","author":"R Thomas","year":"2005","unstructured":"Thomas, R., Wollan, P.: An improved linear edge bound for graph linkages. Eur. J. Comb. 26, 309\u2013324 (2005)","journal-title":"Eur. J. Comb."},{"key":"2970_CR15","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/BF01275674","volume":"11","author":"C Thomassen","year":"1991","unstructured":"Thomassen, C.: Note on highly connected non-2-linked digraphs. Combinatorica 11, 393\u2013395 (1991)","journal-title":"Combinatorica"},{"key":"2970_CR16","unstructured":"Thomassen, C.: Connectivity in tournaments in, Graph Theory and Combinatorics, A Volume in Honour of Paul Erd\u0151s (B. Bollob\u00e1s, ed.), 305-313 (1984)"},{"key":"2970_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113351","volume":"346","author":"J Zhou","year":"2023","unstructured":"Zhou, J., Qi, Y., Yan, J.: Improved results on linkage problems. Discrete Math. 346, 113351 (2023)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02970-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02970-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02970-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T05:11:26Z","timestamp":1760505086000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02970-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,19]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["2970"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02970-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,9,19]]},"assertion":[{"value":"17 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No Conflict of interest exists in the submission of this manuscript, and the manuscript is approved by all authors for publication. I would like to declare on behalf of my co-authors that the work described was original research that has not been published previously, and not under consideration for publication elsewhere, in whole or in part. All the authors listed have approved the manuscript that is enclosed.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"104"}}