{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:24:43Z","timestamp":1757615083922,"version":"3.44.0"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T00:00:00Z","timestamp":1750636800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T00:00:00Z","timestamp":1750636800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2025,8]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>We prove that there exists a constant <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$c &gt; 0$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>c<\/mml:mi>\n                    <mml:mo>&gt;<\/mml:mo>\n                    <mml:mn>0<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> such that the vertices of every strongly <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$c \\cdot kt$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>c<\/mml:mi>\n                    <mml:mo>\u00b7<\/mml:mo>\n                    <mml:mi>k<\/mml:mi>\n                    <mml:mi>t<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>-connected tournament can be partitioned into <jats:italic>t<\/jats:italic> parts, each of which induces a strongly <jats:italic>k<\/jats:italic>-connected tournament. This is clearly tight up to a constant factor, and it confirms a conjecture of K\u00fchn, Osthus and Townsend (2016).<\/jats:p>","DOI":"10.1007\/s00493-025-00161-3","type":"journal-article","created":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T03:40:09Z","timestamp":1750650009000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Partitioning a tournament into sub-tournaments of high connectivity"],"prefix":"10.1007","volume":"45","author":[{"given":"Ant\u00f3nio","family":"Gir\u00e3o","sequence":"first","affiliation":[]},{"given":"Shoham","family":"Letzter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,23]]},"reference":[{"key":"161_CR1","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1006\/jctb.2001.2048","volume":"83","author":"G Chen","year":"2001","unstructured":"Chen, G., Gould, R.J., Li, H.: Partitioning vertices of a tournament into independent cycles. J. Combin. Theory Ser. B 83, 213\u2013220 (2001)","journal-title":"J. Combin. Theory Ser. B"},{"key":"161_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02579344","volume":"3","author":"P Hajnal","year":"1983","unstructured":"Hajnal, P.: Partition of graphs with condition on the connectivity and minimum degree. Combinatorica 3, 95\u201399 (1983)","journal-title":"Combinatorica"},{"key":"161_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.jctb.2019.06.003","volume":"141","author":"DY Kang","year":"2020","unstructured":"Kang, D.Y., Kim, J.: On 1-factors with prescribed lengths in tournaments. J. Combin. Theory Ser. B 141, 31\u201371 (2020)","journal-title":"J. Combin. Theory Ser. B"},{"key":"161_CR4","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1137\/15M1006611","volume":"30","author":"J Kim","year":"2016","unstructured":"Kim, J., K\u00fchn, D., Osthus, D.: Bipartitions of highly connected tournaments. SIAM J. Discr. Math. 30, 895\u2013911 (2016)","journal-title":"SIAM J. Discr. Math."},{"key":"161_CR5","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s00493-015-3186-8","volume":"36","author":"D K\u00fchn","year":"2016","unstructured":"K\u00fchn, D., Osthus, D., Townsend, T.: Proof of a tournament partition conjecture and an application to $$1$$-factors with prescribed cycle lengths. Combinatorica 36, 451\u2013469 (2016)","journal-title":"Combinatorica"},{"key":"161_CR6","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1111\/j.1749-6632.1989.tb16430.x","volume":"576","author":"KB Reid","year":"1989","unstructured":"Reid, K.B.: Three problems on tournaments. Ann. New York Acad. Sci. 576, 466\u2013473 (1989)","journal-title":"Ann. New York Acad. Sci."},{"key":"161_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1002\/jgt.3190070204","volume":"7","author":"C Thomassen","year":"1983","unstructured":"Thomassen, C.: Graph decomposition with constraints on the connectivity and minimum degree. J. Graph Theory 7, 165\u2013167 (1983)","journal-title":"J. Graph Theory"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-025-00161-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-025-00161-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-025-00161-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T12:38:35Z","timestamp":1757075915000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-025-00161-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,23]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["161"],"URL":"https:\/\/doi.org\/10.1007\/s00493-025-00161-3","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"type":"print","value":"0209-9683"},{"type":"electronic","value":"1439-6912"}],"subject":[],"published":{"date-parts":[[2025,6,23]]},"assertion":[{"value":"3 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"34"}}