{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T14:15:32Z","timestamp":1787494532145,"version":"build-2736575974"},"reference-count":8,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2013,3,12]],"date-time":"2013-03-12T00:00:00Z","timestamp":1363046400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[2014,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    We prove that every tournament with minimum out\u2010degree at least\n                    <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/jgt21740-math-0001.png\" xlink:title=\"urn:x-wiley:03649024:media:jgt21740:jgt21740-math-0001\"\/>\n                    contains\n                    <jats:italic>k<\/jats:italic>\n                    disjoint 3\u2010cycles. This provides additional support for the conjecture by Bermond and Thomassen that every digraph\n                    <jats:italic>D<\/jats:italic>\n                    of minimum out\u2010degree\n                    <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/jgt21740-math-0002.png\" xlink:title=\"urn:x-wiley:03649024:media:jgt21740:jgt21740-math-0002\"\/>\n                    contains\n                    <jats:italic>k<\/jats:italic>\n                    vertex disjoint cycles. We also prove that for every\n                    <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/jgt21740-math-0003.png\" xlink:title=\"urn:x-wiley:03649024:media:jgt21740:jgt21740-math-0003\"\/>\n                    , when\n                    <jats:italic>k<\/jats:italic>\n                    is large enough, every tournament with minimum out\u2010degree at least\n                    <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/jgt21740-math-0004.png\" xlink:title=\"urn:x-wiley:03649024:media:jgt21740:jgt21740-math-0004\"\/>\n                    contains\n                    <jats:italic>k<\/jats:italic>\n                    disjoint cycles. The linear factor 1.5 is best possible as shown by the regular tournaments.\n                  <\/jats:p>","DOI":"10.1002\/jgt.21740","type":"journal-article","created":{"date-parts":[[2013,3,14]],"date-time":"2013-03-14T03:23:48Z","timestamp":1363231428000},"page":"284-302","source":"Crossref","is-referenced-by-count":19,"title":["Disjoint 3\u2010Cycles in Tournaments: A Proof of The Bermond\u2013Thomassen Conjecture for Tournaments"],"prefix":"10.1002","volume":"75","author":[{"given":"J\u00f8rgen","family":"Bang\u2010Jensen","sequence":"first","affiliation":[{"name":"DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE UNIVERSITY OF SOUTHERN DENMARK  ODENSE DENMARK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"St\u00e9phane","family":"Bessy","sequence":"additional","affiliation":[{"name":"ALGCO LIRMM  UNIVERSIT\u00c9 MONTPELLIER 2 FRANCE"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"St\u00e9phan","family":"Thomass\u00e9","sequence":"additional","affiliation":[{"name":"LABORATOIRE LIP (U. LYON, CNRS, ENS LYON, INRIA, UCBL)  LYON FRANCE"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2013,3,12]]},"reference":[{"key":"e_1_2_6_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1996.0062"},{"key":"e_1_2_6_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154"},{"key":"e_1_2_6_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-998-1"},{"key":"e_1_2_6_5_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190050102"},{"key":"e_1_2_6_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2009.03.039"},{"key":"e_1_2_6_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2010.06.024"},{"key":"e_1_2_6_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/080715792"},{"key":"e_1_2_6_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579195"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.21740","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.21740","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T05:59:33Z","timestamp":1696312773000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.21740"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,12]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["10.1002\/jgt.21740"],"URL":"https:\/\/doi.org\/10.1002\/jgt.21740","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,12]]}}}