{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T14:49:45Z","timestamp":1782485385646,"version":"3.54.5"},"reference-count":22,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T00:00:00Z","timestamp":1781654400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/100010665","name":"EU Framework Programme for Research and Innovation Marie Sk\u0142odowska-Curie Actions","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100020884","name":"Agencia Nacional de Investigaci\u00f3n y Desarrollo","doi-asserted-by":"publisher","award":["CMM FB210005"],"award-info":[{"award-number":["CMM FB210005"]}],"id":[{"id":"10.13039\/501100020884","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002850","name":"Fondo Nacional de Desarrollo Cient\u00edfico y Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["1221905"],"award-info":[{"award-number":["1221905"]}],"id":[{"id":"10.13039\/501100002850","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002850","name":"Fondo Nacional de Desarrollo Cient\u00edfico y Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["3220838"],"award-info":[{"award-number":["3220838"]}],"id":[{"id":"10.13039\/501100002850","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005739","name":"Universidad Nacional Aut\u00f3noma de M\u00e9xico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005739","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006087","name":"National Autonomous University of Mexico Directorate General of Academic Staff Affairs","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006087","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,12]]},"DOI":"10.1016\/j.disc.2026.115288","type":"journal-article","created":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T07:17:19Z","timestamp":1782112639000},"page":"115288","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Oriented trees in digraphs without oriented 4-cycles"],"prefix":"10.1016","volume":"349","author":[{"given":"Maya","family":"Stein","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1138-1190","authenticated-orcid":false,"given":"Ana","family":"Trujillo-Negrete","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2026.115288_br0030","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1016\/j.disc.2013.01.011","article-title":"Oriented trees in digraphs","volume":"313","author":"Addario-Berry","year":"2013","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115288_br0100","doi-asserted-by":"crossref","first-page":"1521","DOI":"10.1137\/18M1210861","article-title":"Degree conditions for embedding trees","volume":"33","author":"Besomi","year":"2019","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disc.2026.115288_br0010","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0012-365X(95)00207-D","article-title":"The Erd\u0151s-S\u00f3s conjecture for graphs of girth 5","volume":"150","author":"Brandt","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115288_br0040","series-title":"Proceedings of the Eleventh South-Eastern Conference on Combinatorics, Graph Theory and Combinatorics","first-page":"227","article-title":"Subtrees of directed graphs and hypergraphs","volume":"vol. I 28","author":"Burr","year":"1980"},{"key":"10.1016\/j.disc.2026.115288_br0150","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2025.114412","article-title":"Long antipaths and anticycles in oriented graphs","volume":"348","author":"Chen","year":"2025","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115288_br0170","series-title":"Some problems in extremal and algebraic graph theory","author":"Dobson","year":"1995"},{"key":"10.1016\/j.disc.2026.115288_br0090","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/jgt.22511","article-title":"A variant of the Erd\u0151s-S\u00f3s conjecture","volume":"94","author":"Havet","year":"2020","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115288_br0190","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0012-365X(99)00354-4","article-title":"Embedding trees into graphs of large girth","volume":"216","author":"Haxell","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115288_br0180","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1006\/jctb.2001.2049","article-title":"On a conjecture about trees in graphs with large girth","volume":"83","author":"Jiang","year":"2001","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115288_br0070","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2023.113515","article-title":"Antipaths in oriented graphs","volume":"346","author":"Klimo\u0161ov\u00e1","year":"2023","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115288_br0130","author":"Kontogeorgiou"},{"key":"10.1016\/j.disc.2026.115288_br0220","author":"Lu"},{"key":"10.1016\/j.disc.2026.115288_br0110","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1002\/jgt.22897","article-title":"Spanning trees in graphs of high minimum degree with a universal vertex I: an asymptotic result","volume":"102","author":"Reed","year":"2023","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115288_br0120","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1002\/jgt.22899","article-title":"Spanning trees in graphs of high minimum degree with a universal vertex II: a tight result","volume":"102","author":"Reed","year":"2023","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115288_br0020","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1006\/jctb.1997.1758","article-title":"The Erd\u0151s\u2013S\u00f3s conjecture for graphs without C4","volume":"70","author":"Sacl\u00e9","year":"1997","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115288_br0160","article-title":"Alternating paths in oriented graphs with large semidegree","volume":"32","author":"Skokan","year":"2025","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.disc.2026.115288_br0140","series-title":"Discrete Math. Appl.","first-page":"459","article-title":"Tree containment and degree conditions","volume":"vol. 165","author":"Stein","year":"2021"},{"key":"10.1016\/j.disc.2026.115288_br0080","series-title":"Surveys in Combinatorics 2024","first-page":"271","article-title":"Oriented trees and paths in digraphs","volume":"vol. 493","author":"Stein","year":"2024"},{"key":"10.1016\/j.disc.2026.115288_br0210","series-title":"Women in Mathematics in Latin America: ICMAM 2024","first-page":"199","article-title":"Degree conditions for trees in undirected and directed graphs","author":"Stein","year":"2026"},{"key":"10.1016\/j.disc.2026.115288_br0060","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1137\/24M165497X","article-title":"Antidirected trees in dense digraphs","volume":"39","author":"Stein","year":"2025","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disc.2026.115288_br0050","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1017\/S0963548324000038","article-title":"Antidirected subgraphs of oriented graphs","volume":"33","author":"Stein","year":"2024","journal-title":"Comb. Probab. Comput."},{"key":"10.1016\/j.disc.2026.115288_br0200","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s00493-010-2422-5","article-title":"A randomized embedding algorithm for trees","volume":"30","author":"Sudakov","year":"2010","journal-title":"Combinatorica"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26003122?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26003122?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T14:18:27Z","timestamp":1782483507000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X26003122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":22,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["S0012365X26003122"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115288","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Oriented trees in digraphs without oriented 4-cycles","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115288","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115288"}}