{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T19:48:23Z","timestamp":1774727303976,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T00:00:00Z","timestamp":1769990400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T00:00:00Z","timestamp":1769990400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12431013"],"award-info":[{"award-number":["12431013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Basic Research Program of Jiangsu","award":["BK20251044"],"award-info":[{"award-number":["BK20251044"]}]},{"name":"Basic Research Program of Jiangsu","award":["12501483"],"award-info":[{"award-number":["12501483"]}]},{"name":"National Key Research and Development Program of China","award":["2024YFA1013900"],"award-info":[{"award-number":["2024YFA1013900"]}]},{"name":"Natural Science Foundation of the Jiangsu Higher Education Institutions of China","award":["25KJB110003"],"award-info":[{"award-number":["25KJB110003"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10878-026-01393-9","type":"journal-article","created":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T01:14:20Z","timestamp":1769994860000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A note between transitive $$C_4$$-factor and oriented Ramsey number"],"prefix":"10.1007","volume":"51","author":[{"given":"Ming","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengke","family":"Miao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shan","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,2]]},"reference":[{"key":"1393_CR1","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.jctb.2016.12.004","volume":"124","author":"J Balogh","year":"2017","unstructured":"Balogh J, Lo A, Molla T (2017) Transitive triangle tilings in oriented graphs. Journal of Combinatorial Theory Series B 124:64\u201387","journal-title":"Journal of Combinatorial Theory Series B"},{"issue":"3","key":"1393_CR2","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01194393","volume":"52","author":"Y Caro","year":"1989","unstructured":"Caro Y (1989) Decomposition of large combinatorial structures. Arch Math 52(3):289\u2013297","journal-title":"Arch Math"},{"key":"1393_CR3","unstructured":"Cuckler B (2008) On the number of short cycles in regular tournaments, unpublished manuscript"},{"issue":"3","key":"1393_CR4","doi-asserted-by":"publisher","first-page":"1553","DOI":"10.1137\/140974675","volume":"29","author":"L DeBiasio","year":"2015","unstructured":"DeBiasio L, K\u00fchn D, Molla T, Osthus D, Taylor A (2015) Arbitrary orientations of Hamilton cycles in digraphs. SIAM J Discret Math 29(3):1553\u20131584","journal-title":"SIAM J Discret Math"},{"issue":"1","key":"1393_CR5","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1137\/19M1269257","volume":"35","author":"L DeBiasio","year":"2021","unstructured":"DeBiasio L, Lo A, Molla T, Treglown A (2021) Transitive tournament tilings in oriented graphs with large minimum total degree. SIAM J Discret Math 35(1):250\u2013266","journal-title":"SIAM J Discret Math"},{"issue":"4","key":"1393_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.37236\/3610","volume":"22","author":"L DeBiasio","year":"2015","unstructured":"DeBiasio L, Molla T (2015) Semi-degree threshold for anti-directed Hamiltonian cycles. Electronic Journal of Combinatorics 22(4):23","journal-title":"Electronic Journal of Combinatorics"},{"key":"1393_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"1","author":"GA Dirac","year":"1952","unstructured":"Dirac GA (1952) Some theorems on abstract graphs. Proc Lond Math Soc 1:69\u201381","journal-title":"Proc Lond Math Soc"},{"key":"1393_CR8","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.jctb.2022.06.001","volume":"157","author":"N Dragani\u0107","year":"2022","unstructured":"Dragani\u0107 N, Munh\u00e1 Correia D, Sudakov B, Yuster R (2022) Ramsey number of 1-subdivisions of transitive tournaments. Journal of Combinatorial Theory. Series B 157:176\u2013183","journal-title":"Journal of Combinatorial Theory. Series B"},{"key":"1393_CR9","first-page":"125","volume":"9","author":"P Erd\u0151s","year":"1964","unstructured":"Erd\u0151s P, Moser L (1964) On the representation of directed graphs as unions of orderings. A Magyar Tudom\u00e1nyos Akad\u00e9mia. Matematikai Kutat\u00f3 Int\u00e9zet\u00e9nek K\u00f6zlem\u00e9nyei 9:125\u2013132","journal-title":"Matematikai Kutat\u00f3 Int\u00e9zet\u00e9nek K\u00f6zlem\u00e9nyei"},{"issue":"1","key":"1393_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11856-024-2624-y","volume":"263","author":"J Fox","year":"2024","unstructured":"Fox J, He X, Wigderson Y (2024) Ramsey numbers of sparse digraphs. Israel J Math 263(1):1\u201348","journal-title":"Israel J Math"},{"key":"1393_CR11","first-page":"495","volume":"251","author":"A Ghouila-Houri","year":"1960","unstructured":"Ghouila-Houri A (1960) Une condition suffisante d\u2019existence d\u2019un circuit hamiltonien. C R Acad Sci Paris 251:495\u2013497","journal-title":"C R Acad Sci Paris"},{"issue":"4","key":"1393_CR12","first-page":"601","volume":"2","author":"A Hajnal","year":"1970","unstructured":"Hajnal A, Szemer\u00e9di E (1970) Proof of a conjecture of P. Erd\u0151s Combinatorial theory and its applications 2(4):601\u2013623","journal-title":"Erd\u0151s Combinatorial theory and its applications"},{"issue":"3","key":"1393_CR13","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/0212040","volume":"12","author":"P Hell","year":"1983","unstructured":"Hell P, Kirkpatrick DG (1983) On the complexity of general graph factor problems. SIAM J Comput 12(3):601\u2013609","journal-title":"SIAM J Comput"},{"key":"1393_CR14","doi-asserted-by":"crossref","unstructured":"Keevash P, K\u00fchn D, Osthus D (2009) An exact minimum degree condition for Hamilton cycles in oriented graphs. Journal of the London Mathematical Society. Second Series, 79(1):144\u2013166","DOI":"10.1112\/jlms\/jdn065"},{"issue":"4","key":"1393_CR15","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1016\/j.jctb.2008.12.004","volume":"99","author":"P Keevash","year":"2009","unstructured":"Keevash P, Sudakov B (2009) Triangle packings and 1-factors in oriented graphs. Journal of Combinatorial Theory Series B 99(4):709\u2013727","journal-title":"Journal of Combinatorial Theory Series B"},{"issue":"5","key":"1393_CR16","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1017\/S0963548308009218","volume":"17","author":"L Kelly","year":"2008","unstructured":"Kelly L, K\u00fchn D, Osthus D (2008) A Dirac-type result on Hamilton cycles in oriented graphs. Comb Probab Comput 17(5):689\u2013709","journal-title":"Comb Probab Comput"},{"issue":"1","key":"1393_CR17","doi-asserted-by":"publisher","first-page":"9","DOI":"10.37236\/10788","volume":"29","author":"J Kim","year":"2022","unstructured":"Kim J, Lee H, Seo J (2022) On 1-subdivisions of transitive tournaments. Electronic Journal of Combinatorics 29(1):9","journal-title":"Electronic Journal of Combinatorics"},{"key":"1393_CR18","unstructured":"Koml\u00f3s J, Simonovits M (1996) Szemer\u00e9di\u2019s regularity lemma and its applications in graph theory, vol 2. Bolyai Soc. Math. Stud. J\u00e1nos Bolyai Math. Soc, Budapest"},{"issue":"4","key":"1393_CR19","doi-asserted-by":"publisher","first-page":"23","DOI":"10.37236\/7759","volume":"26","author":"L Li","year":"2019","unstructured":"Li L, Molla T (2019) Cyclic triangle factors in regular tournaments. Electronic Journal of Combinatorics 26(4):23","journal-title":"Electronic Journal of Combinatorics"},{"key":"1393_CR20","doi-asserted-by":"crossref","unstructured":"Reid KB (1989) Three problems on tournaments. In Graph theory and its applications: East and West (Jinan, 1986), volume 576 of Ann. New York Acad. Sci., pages 466\u2013473. New York Acad. Sci., New York","DOI":"10.1111\/j.1749-6632.1989.tb16430.x"},{"issue":"2","key":"1393_CR21","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s003730050025","volume":"14","author":"A Sanchez-Flores","year":"1998","unstructured":"Sanchez-Flores A (1998) On tournaments free of large transitive subtournaments. Graphs and Combinatorics 14(2):181\u2013200","journal-title":"Graphs and Combinatorics"},{"issue":"1","key":"1393_CR22","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1090\/S0002-9947-1986-0837805-6","volume":"296","author":"A Thomason","year":"1986","unstructured":"Thomason A (1986) Paths and cycles in tournaments. Trans Am Math Soc 296(1):167\u2013180","journal-title":"Trans Am Math Soc"},{"issue":"3","key":"1393_CR23","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1002\/jgt.20586","volume":"69","author":"A Treglown","year":"2012","unstructured":"Treglown A (2012) A note on some embedding problems for oriented graphs. Journal of Graph Theory 69(3):330\u2013336","journal-title":"Journal of Graph Theory"},{"key":"1393_CR24","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1002\/jgt.23105","volume":"106","author":"Z Wang","year":"2024","unstructured":"Wang Z, Yan J, Zhang J (2024) Cycle-factors in oriented graphs. Journal of Graph Theory 106:947\u2013975","journal-title":"Journal of Graph Theory"},{"issue":"2","key":"1393_CR25","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1023\/B:ORDE.0000009250.31770.34","volume":"20","author":"R Yuster","year":"2003","unstructured":"Yuster R (2003) Tiling transitive tournaments and their blow-ups. Order 20(2):121\u2013133","journal-title":"Order"},{"issue":"1","key":"1393_CR26","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cosrev.2007.07.002","volume":"1","author":"R Yuster","year":"2007","unstructured":"Yuster R (2007) Combinatorial and computational aspects of graph packing and graph decomposition. Computer Science Review 1(1):12\u201326","journal-title":"Computer Science Review"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01393-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-026-01393-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01393-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T18:59:47Z","timestamp":1774724387000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-026-01393-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,2]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["1393"],"URL":"https:\/\/doi.org\/10.1007\/s10878-026-01393-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,2]]},"assertion":[{"value":"19 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"15"}}