{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T11:04:55Z","timestamp":1768734295386,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T00:00:00Z","timestamp":1630368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T00:00:00Z","timestamp":1630368000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s00493-021-4374-3","type":"journal-article","created":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T14:04:40Z","timestamp":1630418680000},"page":"815-837","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["(2K + 1)-Connected Tournaments with Large Minimum Out-Degree are K-Linked"],"prefix":"10.1007","volume":"41","author":[{"given":"Ant\u00f3nio","family":"Gir\u00e3o","sequence":"first","affiliation":[]},{"given":"Kamil","family":"Popielarz","sequence":"additional","affiliation":[]},{"given":"Richard","family":"Snyder","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,31]]},"reference":[{"key":"4374_CR1","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF01261316","volume":"16","author":"B Bollob\u00e1s","year":"1996","unstructured":"B. Bollob\u00e1s and A. Thomason: Highly linked graphs, Combinatorica 16 (1996), 313\u2013320.","journal-title":"Combinatorica"},{"key":"4374_CR2","first-page":"193","volume":"7","author":"P Erd\u0151s","year":"1969","unstructured":"P. Erd\u0151s and A. Hajnal: On complete topological subgraphs of certain graphs, Ann. Univ. Sci. Budapest 7 (1969), 193\u2013199.","journal-title":"Ann. Univ. Sci. Budapest"},{"key":"4374_CR3","unstructured":"J. Fr\u00f6lich, K. Kawarabayashi, T. M\u00fcller, J. Pott and P. Wollan: Linkages in Large Graphs of Bounded Tree-Width, arXiv:1402.5549."},{"key":"4374_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.jctb.2019.02.009","volume":"139","author":"A Gir\u00e3o","year":"2019","unstructured":"A. Gir\u00e3o and R. Snyder: Highly linked tournaments with large minimum out-degree, J. Combin. Theory Ser. B 139 (2019), 251\u2013256.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4374_CR5","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.jctb.2020.09.006","volume":"146","author":"A Gir\u00e3o","year":"2021","unstructured":"A. Gir\u00e3o, R. Snyder and K. Popielarz: Subdivisions of digraphs in tournaments, J. Combin. Theory Ser. B 146 (2021), 266\u2013285.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4374_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.jctb.2019.06.003","volume":"141","author":"D Kang","year":"2020","unstructured":"D. Kang and J. Kim: On 1-factors with prescribed lengths in tournaments, J. Combin. Theory Ser. B 141 (2020), 31\u201371.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4374_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1017\/S096354830000184X","volume":"5","author":"J Koml\u00f3s","year":"1996","unstructured":"J. Koml\u00f3s and E. Szemer\u00e9di: Topological cliques in graphs II, Combin. Probab. and Comput. 5 (1996), 79\u201390.","journal-title":"Combin. Probab. and Comput."},{"key":"4374_CR8","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1112\/plms\/pdu019","volume":"109","author":"D K\u00fchn","year":"2014","unstructured":"D. K\u00fchn, J. Lapinskas, D. Osthus and V. Patel: Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments, Proc. Lond. Math. Soc. 109 (2014), 733\u2013762.","journal-title":"Proc. Lond. Math. Soc."},{"key":"4374_CR9","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1002\/(SICI)1097-0118(199604)21:4<371::AID-JGT2>3.0.CO;2-M","volume":"21","author":"W Mader","year":"1996","unstructured":"W. Mader: On topological tournaments of order 4 in digraphs of outdegree 3, J. Graph Theory 21 (1996), 371\u2013376.","journal-title":"J. Graph Theory"},{"key":"4374_CR10","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.jctb.2015.05.005","volume":"115","author":"A Pokrovskiy","year":"2015","unstructured":"A. Pokrovskiy: Highly linked tournaments, J. Combin. Theory Ser. B 115 (2015), 339\u2013347.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4374_CR11","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.ejc.2004.02.013","volume":"26","author":"R Thomas","year":"2005","unstructured":"R. Thomas and P. Wollan: An improved extremal function for graph linkages, European J. Combin. 26 (2005), 309\u2013324.","journal-title":"European J. Combin."},{"key":"4374_CR12","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/S0195-6698(80)80039-4","volume":"1","author":"C Thomassen","year":"1980","unstructured":"C. Thomassen: 2-linked graphs, European J. Combin. 1 (1980), 371\u2013378.","journal-title":"European J. Combin."},{"key":"4374_CR13","series-title":"Graph Theory and Combinatorics, a Volume in Honour of Paul Erd\u0151s","first-page":"305","volume-title":"Connectivity in tournaments","author":"C Thomassen","year":"1984","unstructured":"C. Thomassen: Connectivity in tournaments, Graph Theory and Combinatorics, a Volume in Honour of Paul Erd\u0151s, Academic Press, London, 1984, 305\u2013313."},{"key":"4374_CR14","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/BF01275674","volume":"11","author":"C Thomassen","year":"1991","unstructured":"C. Thomassen: Highly connected non-2-linked digraphs, Combinatorica 11 (1991), 393\u2013395.","journal-title":"Combinatorica"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-021-4374-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-021-4374-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-021-4374-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T00:03:57Z","timestamp":1640909037000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-021-4374-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,31]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["4374"],"URL":"https:\/\/doi.org\/10.1007\/s00493-021-4374-3","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,31]]},"assertion":[{"value":"12 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}