{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T07:15:12Z","timestamp":1783149312192,"version":"3.54.6"},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100013290","name":"National Key Research and Development Program of China Stem Cell and Translational Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013290","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"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.ejc.2026.104399","type":"journal-article","created":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T08:01:43Z","timestamp":1779868903000},"page":"104399","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Balanced subdivisions and cycles lengths in Ks,t-free graphs"],"prefix":"10.1016","volume":"137","author":[{"given":"Jianfeng","family":"Hou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yindong","family":"Jin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Donglei","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fan","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ejc.2026.104399_b1","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.jctb.2014.11.004","article-title":"Subdivisions of a large clique in C6-free graphs","volume":"112","author":"Balogh","year":"2015","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.ejc.2026.104399_b2","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1006\/eujc.1997.0188","article-title":"Proof of a conjecture of Mader, Erd\u0151s and Hajnal on topological complete subgraphs","volume":"19","author":"Bollob\u00e1s","year":"1998","journal-title":"European J. Combin."},{"key":"10.1016\/j.ejc.2026.104399_b3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1002\/(SICI)1097-0118(199801)27:1<11::AID-JGT3>3.0.CO;2-J","article-title":"Cycles in a graph whose lengths differ by one or two","volume":"27","author":"Bondy","year":"1998","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.ejc.2026.104399_b4","first-page":"3","article-title":"Some recent progress on extremal problems in graph theory","volume":"14","author":"Erd\u0151s","year":"1975","journal-title":"Congr. Numer."},{"key":"10.1016\/j.ejc.2026.104399_b5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF02020444","article-title":"On chromatic number of graphs and set-systems","volume":"17","author":"Erd\u0151s","year":"1966","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"10.1016\/j.ejc.2026.104399_b6","first-page":"193","article-title":"On topological complete subgraphs of certain graphs","volume":"7","author":"Erd\u0151s","year":"1969","journal-title":"Ann. Univ. Sci. Bp."},{"key":"10.1016\/j.ejc.2026.104399_b7","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1006\/jctb.2001.2071","article-title":"Distribution of cycle lengths in graphs","volume":"84","author":"Fan","year":"2002","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.ejc.2026.104399_b8","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/j.jctb.2023.03.002","article-title":"Disjoint isomorphic balanced clique subdivisions","volume":"161","author":"Fern\u00e1ndez","year":"2023","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.ejc.2026.104399_b9","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1002\/rsa.20344","article-title":"Dependent random choice","volume":"38","author":"Fox","year":"2011","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/j.ejc.2026.104399_b10","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s00493-020-4434-0","article-title":"Cycle lengths in expanding graphs","volume":"41","author":"Friedman","year":"2021","journal-title":"Combinatorica"},{"key":"10.1016\/j.ejc.2026.104399_b11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1017\/S0963548300001814","article-title":"An upper bound on Zarankiewicz\u2019 problem","volume":"5","author":"F\u00fcredi","year":"1996","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.ejc.2026.104399_b12","doi-asserted-by":"crossref","first-page":"7615","DOI":"10.1093\/imrn\/rnaa324","article-title":"A unified proof of conjectures on cycle lengths in graphs","volume":"2022","author":"Gao","year":"2022","journal-title":"Int. Math. Res. Not."},{"key":"10.1016\/j.ejc.2026.104399_b13","doi-asserted-by":"crossref","first-page":"2317","DOI":"10.1137\/20M1387882","article-title":"A strengthening on odd cycles in graphs of given chromatic number","volume":"35","author":"Gao","year":"2021","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.ejc.2026.104399_b14","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.jctb.2019.07.005","article-title":"On a conjecture of bondy and vince","volume":"141","author":"Gao","year":"2020","journal-title":"J. Comb. Theory Ser. B"},{"key":"10.1016\/j.ejc.2026.104399_b15","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1002\/jgt.3190080402","article-title":"On the distribution of cycle lengths in graphs","volume":"8","author":"Gy\u00e1rf\u00e1s","year":"1984","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.ejc.2026.104399_b16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jctb.2023.06.002","article-title":"Linear cycles of consecutive lengths","volume":"163","author":"Jiang","year":"2023","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.ejc.2026.104399_b17","doi-asserted-by":"crossref","first-page":"50","DOI":"10.4064\/cm-3-1-50-57","article-title":"On a problem of K. Zarankiewicz","volume":"3","author":"K\u0151v\u00e1ri","year":"1954","journal-title":"Colloq. Math."},{"key":"10.1016\/j.ejc.2026.104399_b18","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1017\/S0963548300001140","article-title":"Topological cliques in graphs","volume":"3","author":"Koml\u00f3s","year":"1994","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.ejc.2026.104399_b19","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1017\/S096354830000184X","article-title":"Topological cliques in graphs II","volume":"5","author":"Koml\u00f3s","year":"1996","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.ejc.2026.104399_b20","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1006\/jctb.2002.2133","article-title":"Topological minors in graphs of large girth","volume":"86","author":"K\u00fchn","year":"2002","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.ejc.2026.104399_b21","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1017\/S0963548303005650","article-title":"Large topological cliques in graphs without a 4-cycle","volume":"13","author":"K\u00fchn","year":"2004","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.ejc.2026.104399_b22","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1137\/040617765","article-title":"Improved bounds for topological cliques in graphs of large girth","volume":"20","author":"K\u00fchn","year":"2006","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.ejc.2026.104399_b23","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1112\/jlms.12019","article-title":"A proof of Mader\u2019s conjecture on large clique subdivisions in C4-free graphs","volume":"95","author":"Liu","year":"2017","journal-title":"J. Lond. Math. Soc."},{"key":"10.1016\/j.ejc.2026.104399_b24","first-page":"1191","article-title":"A solution to Erd\u0151s and Hajnal\u2019s odd cycle problem","volume":"36","author":"Liu","year":"2023","journal-title":"J. Amer. Math. Soc."},{"key":"10.1016\/j.ejc.2026.104399_b25","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1007\/s00493-023-00039-2","article-title":"Balanced subdivisions of cliques in graphs","volume":"43","author":"Luan","year":"2023","journal-title":"Combinatorica"},{"key":"10.1016\/j.ejc.2026.104399_b26","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.ejc.2015.09.002","article-title":"Cycles with consecutive odd lengths","volume":"52","author":"Ma","year":"2016","journal-title":"European J. Combin."},{"key":"10.1016\/j.ejc.2026.104399_b27","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01364272","article-title":"Homomorphieeigenschaften und mittlere Kantendichte von Graphen","volume":"174","author":"Mader","year":"1967","journal-title":"Math. Ann."},{"key":"10.1016\/j.ejc.2026.104399_b28","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/mana.19720530113","article-title":"Hinreichende Bedingungen f\u0171r die Existenz von Teilgraphen, die zu einem vollsta\u030bndigen Graphen hom\u0151omorph sind","volume":"53","author":"Mader","year":"1972","journal-title":"Math. Nachr."},{"key":"10.1016\/j.ejc.2026.104399_b29","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/(SICI)1097-0118(199904)30:4<261::AID-JGT2>3.0.CO;2-Z","article-title":"An extremal problem for subdivisions of K5\u2212","volume":"30","author":"Mader","year":"1999","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.ejc.2026.104399_b30","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s00493-008-2300-6","article-title":"Cycle lengths in sparse graphs","volume":"28","author":"Sudakov","year":"2008","journal-title":"Combinatorica"},{"key":"10.1016\/j.ejc.2026.104399_b31","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1111\/j.1749-6632.1989.tb22479.x","article-title":"Configurations in graphs of large minimum degree, connectivity, or chromatic number","volume":"1","author":"Thomason","year":"1989","journal-title":"Ann. New York Acad. Sci."},{"key":"10.1016\/j.ejc.2026.104399_b32","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/jgt.3190080103","article-title":"Subdivisions of graphs with large minimum degree","volume":"8","author":"Thomassen","year":"1984","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.ejc.2026.104399_b33","series-title":"Hypergraphs and Applications","article-title":"Problems 20 and 21, in graphs","volume":"Vol. 217","author":"Thomassen","year":"1985"},{"key":"10.1016\/j.ejc.2026.104399_b34","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1017\/S0963548300004478","article-title":"On arithmetic progressions of cycle lengths in graphs","volume":"9","author":"Verstra\u00ebte","year":"2000","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.ejc.2026.104399_b35","doi-asserted-by":"crossref","first-page":"1262","DOI":"10.1137\/22M1511266","article-title":"Balanced subdivisions of a large clique in graphs with high average degree","volume":"37","author":"Wang","year":"2023","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.ejc.2026.104399_b36","doi-asserted-by":"crossref","DOI":"10.1112\/jlms.70073","article-title":"Embedding clique subdivisions via crux","volume":"111","author":"Yang","year":"2025","journal-title":"J. Lond. Math. Soc."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000673?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000673?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T06:17:55Z","timestamp":1783145875000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669826000673"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":36,"alternative-id":["S0195669826000673"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104399","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Balanced subdivisions and cycles lengths in -free graphs","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104399","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104399"}}