{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T10:01:41Z","timestamp":1777629701406,"version":"3.51.4"},"reference-count":30,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003819","name":"Hubei Province Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003819","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004772","name":"Ningxia Hui Autonomous Region Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004772","id-type":"DOI","asserted-by":"publisher"}]},{"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,8]]},"DOI":"10.1016\/j.disc.2026.115074","type":"journal-article","created":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T14:41:44Z","timestamp":1772548904000},"page":"115074","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["The bipartite Tur\u00e1n number of independent cycles with different lengths"],"prefix":"10.1016","volume":"349","author":[{"given":"Panpan","family":"Cheng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5284-6217","authenticated-orcid":false,"given":"Yunshu","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Suyun","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2026.115074_br0010","series-title":"Graph Theory","author":"Bondy","year":"2008"},{"key":"10.1016\/j.disc.2026.115074_br0020","article-title":"Disjoint cycles of different lengths in graphs and digraphs","volume":"24","author":"Bensmail","year":"2017","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.disc.2026.115074_br0030","doi-asserted-by":"crossref","first-page":"5886","DOI":"10.1016\/j.disc.2007.10.040","article-title":"Disjoint chorded cycles in graphs","volume":"308","author":"Bialostocki","year":"2008","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115074_br0040","article-title":"Extremal function of two independent chorded cycles in bipartite graphs","volume":"493","author":"Cheng","year":"2025","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.disc.2026.115074_br0050","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/j.laa.2023.07.010","article-title":"The bipartite Tur\u00e1n number and spectral extremum for linear forests","volume":"676","author":"Chen","year":"2023","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.disc.2026.115074_br0060","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1090\/S0002-9904-1946-08715-7","article-title":"On the structure of linear graphs","volume":"52","author":"Erd\u0151s","year":"1946","journal-title":"Bull. Am. Math. Soc."},{"key":"10.1016\/j.disc.2026.115074_br0070","first-page":"51","article-title":"A limit theorem in graph theory","volume":"1","author":"Erd\u0151s","year":"1966","journal-title":"Studia Sci. Math. Hung."},{"key":"10.1016\/j.disc.2026.115074_br0080","doi-asserted-by":"crossref","first-page":"3","DOI":"10.5486\/PMD.1962.9.1-2.02","article-title":"On the maximal number of disjoint circuits of a graph","volume":"9","author":"Erd\u0151s","year":"1962","journal-title":"Publ. Math. (Debr.)"},{"key":"10.1016\/j.disc.2026.115074_br0090","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0195-6698(95)90039-X","article-title":"On product representation of powers I","volume":"16","author":"Erd\u0151s","year":"1995","journal-title":"Eur. J. Comb."},{"issue":"1","key":"10.1016\/j.disc.2026.115074_br0100","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1006\/jcta.1996.0067","article-title":"New asymptotics for bipartite Tur\u00e1n numbers","volume":"75","author":"F\u00fcredi","year":"1996","journal-title":"J. Comb. Theory, Ser. A"},{"key":"10.1016\/j.disc.2026.115074_br0130","doi-asserted-by":"crossref","first-page":"2482","DOI":"10.1016\/j.disc.2019.05.028","article-title":"Vertex-disjoint double chorded cycles in bipartite graphs","volume":"342","author":"Gao","year":"2019","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115074_br0140","article-title":"The edge condition for independent cycles with chords in bipartite graphs","volume":"377","author":"Gao","year":"2020","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"10.1016\/j.disc.2026.115074_br0110","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/jgt.3190080109","article-title":"An extremal problem for paths in bipartite graphs","volume":"8","author":"Gy\u00e1rf\u00e1s","year":"1984","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115074_br0120","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0012-365X(96)00184-7","article-title":"C6-free bipartite graphs and product representation of squares","volume":"165\/166","author":"Gy\u0151ri","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115074_br0150","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1137\/100802463","article-title":"Vertex disjoint cycles of different length in digraphs","volume":"26","author":"Henning","year":"2012","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"10.1016\/j.disc.2026.115074_br0160","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/s00373-022-02465-3","article-title":"Disjoint cycles of different lengths in 3-regular digraphs","volume":"38","author":"He","year":"2022","journal-title":"Graphs Comb."},{"key":"10.1016\/j.disc.2026.115074_br0170","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/0095-8956(81)90050-2","article-title":"Cycles in bipartite graphs","volume":"30","author":"Jackson","year":"1981","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115074_br0180","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/0095-8956(85)90077-2","article-title":"Long cycles in bipartite graphs","volume":"38","author":"Jackson","year":"1985","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115074_br0190","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.jctb.2018.04.004","article-title":"Cycles of given lengths in hypergraphs","volume":"133","author":"Jiang","year":"2018","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115074_br0200","doi-asserted-by":"crossref","first-page":"50","DOI":"10.4064\/cm-3-1-50-57","article-title":"On a problem of Zarankiewicz","volume":"3","author":"K\u0151v\u00e1ri","year":"1954","journal-title":"Colloq. Math."},{"issue":"2","key":"10.1016\/j.disc.2026.115074_br0210","doi-asserted-by":"crossref","first-page":"62","DOI":"10.37236\/3142","article-title":"On the Tur\u00e1n number of forests","volume":"20","author":"Lidick\u00fd","year":"2013","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.disc.2026.115074_br0220","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1002\/jgt.22676","article-title":"Exact bipartite Tur\u00e1n numbers of large even cycles","volume":"97","author":"Li","year":"2021","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115074_br0230","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1017\/S0963548305007029","article-title":"A note on bipartite graphs without 2k-cycles","volume":"14","author":"Naor","year":"2005","journal-title":"Comb. Probab. Comput."},{"key":"10.1016\/j.disc.2026.115074_br0240","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/jgt.3190190305","article-title":"Cycles in bipartite graphs and an application in number theory","volume":"19","author":"S\u00e1rk\u00f6zy","year":"1995","journal-title":"J. Graph Theory"},{"issue":"7","key":"10.1016\/j.disc.2026.115074_br0250","doi-asserted-by":"crossref","first-page":"2811","DOI":"10.1090\/proc\/15042","article-title":"Tur\u00e1n number of bipartite graphs with no Kt,t","volume":"148","author":"Sudakov","year":"2020","journal-title":"Proc. Am. Math. Soc."},{"key":"10.1016\/j.disc.2026.115074_br0260","first-page":"436","article-title":"On an extremal problem in graph theory","volume":"48","author":"Tur\u00e1n","year":"1941","journal-title":"Mat. Fiz. Lapok"},{"issue":"1","key":"10.1016\/j.disc.2026.115074_br0270","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1137\/20M1351047","article-title":"Tournaments and bipartite tournaments without vertex disjoint cycles of different lengths","volume":"35","author":"Tan","year":"2021","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disc.2026.115074_br0280","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s003730170065","article-title":"On independent cycles in a bipartite graph","volume":"17","author":"Wang","year":"2001","journal-title":"Graphs Comb."},{"key":"10.1016\/j.disc.2026.115074_br0290","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1006\/jctb.1996.0037","article-title":"On the maximum number of independent cycles in a bipartite graph","volume":"67","author":"Wang","year":"1996","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115074_br0300","doi-asserted-by":"crossref","first-page":"5","DOI":"10.7151\/dmgt.2429","article-title":"Extremal graphs for even linear forests in bipartite graphs","volume":"44","author":"Yuan","year":"2024","journal-title":"Discuss. Math., Graph Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26000981?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26000981?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T02:35:24Z","timestamp":1777430124000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X26000981"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":30,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["S0012365X26000981"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115074","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The bipartite Tur\u00e1n number of independent cycles with different lengths","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115074","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":"115074"}}