{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T07:52:03Z","timestamp":1776153123941,"version":"3.50.1"},"reference-count":38,"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\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12571363"],"award-info":[{"award-number":["12571363"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004735","name":"Hunan Provincial Natural Science Foundation","doi-asserted-by":"publisher","award":["2025JJ30003"],"award-info":[{"award-number":["2025JJ30003"]}],"id":[{"id":"10.13039\/501100004735","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.115127","type":"journal-article","created":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T13:50:25Z","timestamp":1774273825000},"page":"115127","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximum number of cliques in\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" altimg=\"si1.svg\">\n                      <mml:mo stretchy=\"false\">{<\/mml:mo>\n                      <mml:msub>\n                        <mml:mrow>\n                          <mml:mi>C<\/mml:mi>\n                        <\/mml:mrow>\n                        <mml:mrow>\n                          <mml:msub>\n                            <mml:mrow>\n                              <mml:mi>k<\/mml:mi>\n                            <\/mml:mrow>\n                            <mml:mrow>\n                              <mml:mn>1<\/mml:mn>\n                            <\/mml:mrow>\n                          <\/mml:msub>\n                        <\/mml:mrow>\n                      <\/mml:msub>\n                      <mml:mo>,<\/mml:mo>\n                      <mml:msub>\n                        <mml:mrow>\n                          <mml:mi>C<\/mml:mi>\n                        <\/mml:mrow>\n                        <mml:mrow>\n                          <mml:msub>\n                            <mml:mrow>\n                              <mml:mi>k<\/mml:mi>\n                            <\/mml:mrow>\n                            <mml:mrow>\n                              <mml:mn>2<\/mml:mn>\n                            <\/mml:mrow>\n                          <\/mml:msub>\n                        <\/mml:mrow>\n                      <\/mml:msub>\n                      <mml:mo>,<\/mml:mo>\n                      <mml:msub>\n                        <mml:mrow>\n                          <mml:mi>C<\/mml:mi>\n                        <\/mml:mrow>\n                        <mml:mrow>\n                          <mml:msub>\n                            <mml:mrow>\n                              <mml:mi>k<\/mml:mi>\n                            <\/mml:mrow>\n                            <mml:mrow>\n                              <mml:mn>3<\/mml:mn>\n                            <\/mml:mrow>\n                          <\/mml:msub>\n                        <\/mml:mrow>\n                      <\/mml:msub>\n                      <mml:mo>,<\/mml:mo>\n                      <mml:mo>\u22ef<\/mml:mo>\n                      <mml:mo stretchy=\"false\">}<\/mml:mo>\n                    <\/mml:math>\n                    -free graphs with 6\u202f=\u202fk1\u202f&lt;\u202fk2\u202f&lt;\u202f\u22ef and k+1\u202f\u2212\u202fk\u202f\u2264\u202f5"],"prefix":"10.1016","volume":"349","author":[{"given":"Chenglin","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuejian","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojun","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2026.115127_br0010","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.jctb.2016.03.004","article-title":"Many T copies in H-free graphs","volume":"121","author":"Alon","year":"2016","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115127_br0030","author":"Bai"},{"key":"10.1016\/j.disc.2026.115127_br0040","author":"Bai"},{"key":"10.1016\/j.disc.2026.115127_br0050","unstructured":"Y. Bai, C. Tompkins, C. Well, Generalized Tur\u00e1n problem for cycles of small lengths modulo k, preprint, 2024."},{"key":"10.1016\/j.disc.2026.115127_br0060","unstructured":"C. Barefoot, L. Clark, J. Douthett, R. Entringer, M. Fellows, Cycles of length 0 modulo 3 in graphs, preprint, 1991."},{"key":"10.1016\/j.disc.2026.115127_br0070","doi-asserted-by":"crossref","first-page":"2416","DOI":"10.1137\/24M1632632","article-title":"On the generalized Tur\u00e1n problem for odd cycles","volume":"38","author":"Beke","year":"2024","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disc.2026.115127_br0080","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1112\/blms\/9.1.97","article-title":"Cycles modulo k","volume":"9","author":"Bollob\u00e1s","year":"1997","journal-title":"Bull. Lond. Math. Soc."},{"key":"10.1016\/j.disc.2026.115127_br0090","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1006\/jctb.1994.1019","article-title":"Graphs with a cycle of length divisible by three","volume":"60","author":"Chen","year":"1994","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115127_br0100","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0012-365X(93)90535-2","article-title":"Cycles of length 0 modulo 4 in graphs","volume":"121","author":"Dean","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115127_br0110","first-page":"3","article-title":"Some recent problems and results in graph theory, combinatorics, and number theory","author":"Erd\u0151s","year":"1976","journal-title":"Util. Math."},{"key":"10.1016\/j.disc.2026.115127_br0120","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02024498","article-title":"On maximal paths and circuits of graphs","volume":"10","author":"Erd\u0151s","year":"1959","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"10.1016\/j.disc.2026.115127_br0130","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.115127_br0140","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.115127_br0150","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/jgt.23074","article-title":"On two cycles of consecutive even lengths","volume":"106","author":"Gao","year":"2024","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115127_br0160","author":"Gao"},{"key":"10.1016\/j.disc.2026.115127_br0170","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2023.113395","article-title":"Generalized Tur\u00e1n problems for double stars","volume":"346","author":"Gerbner","year":"2023","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115127_br0180","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.jctb.2020.05.005","article-title":"Generalized Tur\u00e1n problems for even cycles","volume":"145","author":"Gerbner","year":"2020","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115127_br0190","doi-asserted-by":"crossref","first-page":"3130","DOI":"10.1016\/j.disc.2019.06.022","article-title":"Generalized Tur\u00e1n problems for disjoint copies of graphs","volume":"342","author":"Gerbner","year":"2019","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115127_br0200","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2019.103001","article-title":"Counting copies of a fixed subgraph in F-free graphs","volume":"82","author":"Gerbner","year":"2019","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115127_br0210","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2022.103519","article-title":"Some exact results for generalized Tur\u00e1n problems","volume":"103","author":"Gerbner","year":"2022","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115127_br0220","author":"Gy\u0151ri"},{"key":"10.1016\/j.disc.2026.115127_br0230","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2021.103367","article-title":"Maximizing five-cycles in Kr-free graphs","volume":"97","author":"Lidick\u1ef3","year":"2021","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115127_br0240","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0166-218X(01)00190-1","article-title":"Cycles of length 1 modulo 3 in graph","volume":"113","author":"Lu","year":"2001","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2026.115127_br0250","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.jctb.2017.08.005","article-title":"The maximum number of cliques in graphs without long cycles","volume":"128","author":"Luo","year":"2018","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"4","key":"10.1016\/j.disc.2026.115127_br0260","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1007\/s00026-023-00682-y","article-title":"The maximum number of cliques in graphs with bounded odd circumference","volume":"28","author":"Lv","year":"2024","journal-title":"Ann. Comb."},{"key":"10.1016\/j.disc.2026.115127_br0270","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2019.103026","article-title":"Some sharp results on the generalized Tur\u00e1n numbers","volume":"84","author":"Ma","year":"2020","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115127_br0280","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.jctb.2023.06.004","article-title":"Every graph is eventually Tur\u00e1n-good","volume":"162","author":"Morrison","year":"2023","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115127_br0290","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0012-365X(92)90609-J","article-title":"Cycles of length 2 modulo 3 in graphs","volume":"101","author":"Saito","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115127_br0020","article-title":"The extremal function for cycles of length \u2113modk","volume":"24","author":"Sudakov","year":"2017","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.disc.2026.115127_br0300","first-page":"436","article-title":"On an external problem in graph theory","volume":"48","author":"Tur\u00e1n","year":"1941","journal-title":"Mat. Fiz. Lapok"},{"key":"10.1016\/j.disc.2026.115127_br0310","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":"Comb. Probab. Comput."},{"key":"10.1016\/j.disc.2026.115127_br0320","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2019.103057","article-title":"The shifting method and generalized Tur\u00e1n number of matchings","volume":"85","author":"Wang","year":"2020","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115127_br0330","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00373-024-02876-4","article-title":"On generalized Tur\u00e1n numbers of intersecting cliques","volume":"41","author":"Yuan","year":"2025","journal-title":"Graphs Comb."},{"key":"10.1016\/j.disc.2026.115127_br0340","article-title":"Maximum cliques in a graph without disjoint given subgraph","volume":"347","author":"Zhang","year":"2024","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115127_br0350","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/s00373-021-02403-9","article-title":"The generalized Tur\u00e1n number of spanning linear forests","volume":"38","author":"Zhang","year":"2022","journal-title":"Graphs Comb."},{"key":"10.1016\/j.disc.2026.115127_br0360","unstructured":"Xiaojun Zhao, Yuejian Peng, The maximum number of triangles in graphs without cycles of length 0mod5, J. Graph Theory, 1st revision."},{"key":"10.1016\/j.disc.2026.115127_br0370","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2022.112997","article-title":"Generalized Tur\u00e1n number for linear forests","volume":"345","author":"Zhu","year":"2022","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115127_br0380","first-page":"163","article-title":"On some properties of linear complexes","volume":"66","author":"Zykov","year":"1949","journal-title":"Mat. Sb."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26001512?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26001512?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T07:00:52Z","timestamp":1776150052000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X26001512"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":38,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["S0012365X26001512"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115127","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":"Maximum number of cliques in -free graphs with 6\u202f=\u202fk1\u202f<\u202fk2\u202f<\u202f\u22ef and ki+1\u202f\u2212\u202fki\u202f\u2264\u202f5","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115127","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":"115127"}}