{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T08:15:55Z","timestamp":1783066555130,"version":"3.54.6"},"reference-count":20,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.disc.2026.115229","type":"journal-article","created":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T07:18:30Z","timestamp":1780039110000},"page":"115229","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["TT3-factors in oriented graphs with low independence number"],"prefix":"10.1016","volume":"349","author":[{"given":"Ming","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yue","family":"Kou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaonan","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.disc.2026.115229_br0010","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/j.jcss.2004.04.008","article-title":"Testing subgraphs in directed graphs","volume":"69","author":"Alon","year":"2004","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.disc.2026.115229_br0020","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.jctb.2016.12.004","article-title":"Transitive triangle tilings in oriented graphs","volume":"124","author":"Balogh","year":"2017","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"4","key":"10.1016\/j.disc.2026.115229_br0030","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1002\/rsa.20670","article-title":"Triangle factors of graphs without large independent sets and of weighted graphs","volume":"49","author":"Balogh","year":"2016","journal-title":"Random Struct. Algorithms"},{"issue":"3\u20134","key":"10.1016\/j.disc.2026.115229_br0040","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF01895727","article-title":"On the maximal number of independent circuits in graph","volume":"14","author":"Corr\u00e1di","year":"1963","journal-title":"Acta Math. Acad. Sci. Hung."},{"issue":"1","key":"10.1016\/j.disc.2026.115229_br0050","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1137\/19M1269257","article-title":"Transitive tournament tilings in oriented graphs with large minimum total degree","volume":"35","author":"DeBiasio","year":"2021","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disc.2026.115229_br0060","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","article-title":"Some theorems on abstract graphs","volume":"1","author":"Dirac","year":"1952","journal-title":"Proc. Lond. Math. Soc."},{"key":"10.1016\/j.disc.2026.115229_br0070","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1017\/CBO9780511662034.025","article-title":"Tur\u00e1n-Ramsey theorems and Kp-independence numbers","author":"Erd\u0151s","year":"1997","journal-title":"Combin. Geom. Probab."},{"issue":"1","key":"10.1016\/j.disc.2026.115229_br0080","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF02579342","article-title":"More results on Ramsey-Tur\u00e1n type problems","volume":"3","author":"Erd\u0151s","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/j.disc.2026.115229_br0090","series-title":"Combinatorial Theory and Its Applications, II","first-page":"395","article-title":"Some remarks on Ramsey's and Tur\u00e1n's theorem","author":"Erd\u0151s","year":"1970"},{"issue":"4","key":"10.1016\/j.disc.2026.115229_br0100","first-page":"601","article-title":"Proof of a conjecture of P. Erd\u0151s","volume":"2","author":"Hajnal","year":"1970","journal-title":"Combin. Theory Appl."},{"issue":"2","key":"10.1016\/j.disc.2026.115229_br0110","doi-asserted-by":"crossref","first-page":"732","DOI":"10.1137\/080729657","article-title":"On perfect matchings in uniform hypergraphs with large minimum vertex degree","volume":"23","author":"H\u00e0n","year":"2009","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"10.1016\/j.disc.2026.115229_br0120","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/0212040","article-title":"On the complexity of general graph factor problems","volume":"12","author":"Hell","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.disc.2026.115229_br0130","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","article-title":"Random Graphs","author":"Janson","year":"2000"},{"issue":"4","key":"10.1016\/j.disc.2026.115229_br0140","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1016\/j.jctb.2008.12.004","article-title":"Triangle packings and 1-factors in oriented graphs","volume":"99","author":"Keevash","year":"2009","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"5","key":"10.1016\/j.disc.2026.115229_br0150","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1017\/S0963548308009218","article-title":"A Dirac-type result on Hamilton cycles in oriented graphs","volume":"17","author":"Kelly","year":"2008","journal-title":"Comb. Probab. Comput."},{"key":"10.1016\/j.disc.2026.115229_br0160","author":"Montgomery"},{"issue":"2","key":"10.1016\/j.disc.2026.115229_br0170","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.1137\/18M1211970","article-title":"On a Ramsey\u2013Tur\u00e1n variant of the Hajnal\u2013Szemer\u00e9di theorem","volume":"34","author":"Nenadov","year":"2020","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disc.2026.115229_br0180","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1017\/S0963548305007042","article-title":"A Dirac-type theorem for 3-uniform hypergraphs","volume":"15","author":"R\u00f6dl","year":"2006","journal-title":"Comb. Probab. Comput."},{"issue":"3","key":"10.1016\/j.disc.2026.115229_br0190","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1016\/j.jcta.2008.10.002","article-title":"Perfect matchings in large uniform hypergraphs with large minimum collective degree","volume":"116","author":"R\u00f6dl","year":"2009","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"3","key":"10.1016\/j.disc.2026.115229_br0200","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1002\/jgt.20586","article-title":"A note on some embedding problems for oriented graphs","volume":"69","author":"Treglown","year":"2012","journal-title":"J. Graph Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26002530?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26002530?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T07:20:56Z","timestamp":1783063256000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X26002530"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":20,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2026,10]]}},"alternative-id":["S0012365X26002530"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115229","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"TT3-factors in oriented graphs with low independence number","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115229","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115229"}}