{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:59:58Z","timestamp":1773273598536,"version":"3.50.1"},"reference-count":31,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"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","award":["12171323"],"award-info":[{"award-number":["12171323"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100021171","name":"Basic and Applied Basic Research Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2022A1515011995"],"award-info":[{"award-number":["2022A1515011995"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.dam.2026.01.011","type":"journal-article","created":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T13:33:44Z","timestamp":1769520824000},"page":"134-145","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Extremal oriented graphs avoiding 1-subdivision of an in-star"],"prefix":"10.1016","volume":"385","author":[{"given":"Zejun","family":"Huang","sequence":"first","affiliation":[]},{"given":"Chenxi","family":"Yang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.01.011_b1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1002\/jgt.3190040311","article-title":"Girth in digraphs","volume":"4","author":"Bermond","year":"1980","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.01.011_b2","first-page":"1231","article-title":"Extremal graph theory","volume":"vol. 1, 2","author":"Bollob\u00e1s","year":"1995"},{"key":"10.1016\/j.dam.2026.01.011_b3","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0095-8956(73)90034-8","article-title":"Extremal problems for directed graphs","volume":"15","author":"Brown","year":"1973","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2026.01.011_b4","series-title":"Finite and infinite sets, Vol. I, II (Eger, 1981), 119-156, Colloq. Math. Soc. J\u00e1nos Bolyai, 37","article-title":"Inverse extremal digraph problems","author":"Brown","year":"1984"},{"key":"10.1016\/j.dam.2026.01.011_b5","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1090\/S0002-9947-1985-0808730-0","article-title":"Algorithmic solution of extremal digraph problems","volume":"292","author":"Brown","year":"1985","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/j.dam.2026.01.011_b6","series-title":"Combinatorial Theory and Its Applications, I-III (Proc. Colloq. Balatonf\u00fcred, 1969), 135-198, Colloq. Math. Soc. J\u00e1nos Bolyai, 4","article-title":"Extremal digraphs","author":"Brown","year":"1970"},{"key":"10.1016\/j.dam.2026.01.011_b7","doi-asserted-by":"crossref","first-page":"2535","DOI":"10.1007\/s00373-021-02373-y","article-title":"3-free strong digraphs with the maximum size","volume":"37","author":"Chen","year":"2021","journal-title":"Graphs Combin."},{"key":"10.1016\/j.dam.2026.01.011_b8","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/j.dam.2022.03.009","article-title":"Tur\u00e1n number of 3-free strong digraphs with out-degree restriction","volume":"314","author":"Chen","year":"2022","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.01.011_b9","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0095-8956(76)90063-0","article-title":"On pancyclic digraphs","volume":"20","author":"H\u00e4ggkvist","year":"1976","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2026.01.011_b10","doi-asserted-by":"crossref","first-page":"3457","DOI":"10.1109\/TIT.2025.3545662","article-title":"On the capacity of DNA labeling","volume":"71","author":"Hanania","year":"2025","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.dam.2026.01.011_b11","doi-asserted-by":"crossref","unstructured":"C. Hofmeister, A. Gruica, D. Hanania, R. Bitar, E. Yaakobi, Achieving DNA labeling capacity with minimum labels through extremal de Bruijn subgraphs, in: 2024 IEEE International Symposium on Information Theory, ISIT, 2024, pp. 452\u2013457.","DOI":"10.1109\/ISIT57864.2024.10619168"},{"key":"10.1016\/j.dam.2026.01.011_b12","doi-asserted-by":"crossref","first-page":"388","DOI":"10.21136\/CPM.1982.118147","article-title":"On the maximum number of arcs in some classes of graphs","volume":"107","author":"Howalla","year":"1982","journal-title":"\u010casopis P\u011bst. Mat."},{"key":"10.1016\/j.dam.2026.01.011_b13","doi-asserted-by":"crossref","first-page":"53","DOI":"10.21136\/CPM.1983.118158","article-title":"An extremal problem for some classes of oriented graphs","volume":"108","author":"Howalla","year":"1983","journal-title":"\u010casopis P\u011bst. Mat."},{"key":"10.1016\/j.dam.2026.01.011_b14","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.laa.2018.11.026","article-title":"0-1 matrices with zero trace whose squares are 0-1 matrices","volume":"565","author":"Huang","year":"2019","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2026.01.011_b15","doi-asserted-by":"crossref","first-page":"1972","DOI":"10.1080\/03081087.2019.1567671","article-title":"0-1 matrices whose kth powers have bounded entries","volume":"68","author":"Huang","year":"2020","journal-title":"Linear Multilinear Algebra"},{"key":"10.1016\/j.dam.2026.01.011_b16","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2020.111827","article-title":"Extremal digraphs avoiding an orientation of C4","volume":"343","author":"Huang","year":"2020","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.01.011_b17","doi-asserted-by":"crossref","first-page":"1703","DOI":"10.1016\/j.disc.2019.02.002","article-title":"A Tur\u00e1n problem on digraphs avoiding distinct walks of a given length with the same endpoints","volume":"342","author":"Huang","year":"2019","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.01.011_b18","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.disc.2010.09.025","article-title":"Digraphs that have at most one walk of a given length with the same endpoints","volume":"311","author":"Huang","year":"2011","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.01.011_b19","doi-asserted-by":"crossref","first-page":"2203","DOI":"10.1016\/j.disc.2012.04.008","article-title":"Extremal digraphs whose walks with the same initial and terminal vertices have distinct lengths","volume":"312","author":"Huang","year":"2012","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.01.011_b20","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1007\/s10878-021-00718-0","article-title":"Digraphs that contain at most t distinct walks of a given length with the same endpoints","volume":"41","author":"Lyu","year":"2021","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.dam.2026.01.011_b21","doi-asserted-by":"crossref","first-page":"1373","DOI":"10.1007\/s00373-021-02324-7","article-title":"Extremal digraphs avoiding an orientation of the diamond","volume":"37","author":"Lyu","year":"2021","journal-title":"Graphs Combin."},{"key":"10.1016\/j.dam.2026.01.011_b22","doi-asserted-by":"crossref","first-page":"985","DOI":"10.7151\/dmgt.2321","article-title":"Extremal digraphs avoiding distinct walks of length 4 with the same endpoints","volume":"42","author":"Lyu","year":"2022","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.dam.2026.01.011_b23","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s00373-021-02449-9","article-title":"A note on extremal digraphs containing at most t walks of length k with the same endpoints","volume":"38","author":"Lyu","year":"2022","journal-title":"Graphs Combin."},{"key":"10.1016\/j.dam.2026.01.011_b24","first-page":"60","article-title":"Problem 28","volume":"10","author":"Mantel","year":"1907","journal-title":"Wiskd. Opgaven"},{"key":"10.1016\/j.dam.2026.01.011_b25","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0012-365X(80)90052-7","article-title":"A generalization of Tur\u00e1n\u2019s theorem to directed graphs","volume":"32","author":"Maurer","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.01.011_b26","series-title":"Surveys in Combinatorics 2011 141-181","article-title":"Some new results in extremal graph theory","volume":"vol. 392","author":"Nikiforov","year":"2011"},{"key":"10.1016\/j.dam.2026.01.011_b27","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s00373-023-02619-x","article-title":"Tur\u00e1n problems for k-geodetic digraphs","volume":"39","author":"Tuite","year":"2023","journal-title":"Graphs Combin."},{"key":"10.1016\/j.dam.2026.01.011_b28","first-page":"436","article-title":"Eine extremalaufgabe aus der graphentheorie","volume":"48","author":"Tur\u00e1n","year":"1941","journal-title":"(Hungarian) Mat. Fiz. Lapok"},{"key":"10.1016\/j.dam.2026.01.011_b29","series-title":"Introduction To Graph Theory","author":"West","year":"1996"},{"key":"10.1016\/j.dam.2026.01.011_b30","doi-asserted-by":"crossref","first-page":"2909","DOI":"10.1016\/j.laa.2009.12.033","article-title":"On the 0-1 matrices whose squares are 0-1 matrices","volume":"432","author":"Wu","year":"2010","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2026.01.011_b31","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s00373-023-02647-7","article-title":"The Tur\u00e1n number of directed paths and oriented cycles","volume":"39","author":"Zhou","year":"2023","journal-title":"Graph Comb."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26000363?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26000363?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T09:30:26Z","timestamp":1773221426000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26000363"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":31,"alternative-id":["S0166218X26000363"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.01.011","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Extremal oriented graphs avoiding 1-subdivision of an in-star","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.01.011","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"}]}}