{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T13:16:35Z","timestamp":1778591795893,"version":"3.51.4"},"reference-count":22,"publisher":"Elsevier BV","issue":"9","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\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12331012"],"award-info":[{"award-number":["12331012"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12571375"],"award-info":[{"award-number":["12571375"]}],"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,9]]},"DOI":"10.1016\/j.disc.2026.115159","type":"journal-article","created":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T20:43:54Z","timestamp":1775681034000},"page":"115159","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Many cliques in graphs with bounded matching number and circumference"],"prefix":"10.1016","volume":"349","author":[{"given":"Yongchun","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7752-0392","authenticated-orcid":false,"given":"Liying","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yisai","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2026.115159_br0010","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.jctb.2023.12.002","article-title":"Tur\u00e1n graphs with bounded matching number","volume":"165","author":"Alon","year":"2024","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115159_br0020","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.115159_br0030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jctb.2021.05.005","article-title":"Many cliques with few edges and bounded maximum degree","volume":"151","author":"Chakraborti","year":"2021","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115159_br0040","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2024.103955","article-title":"Exact results on generalized Erd\u0151s-Gallai problems","volume":"120","author":"Chakraborti","year":"2024","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115159_br0050","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/0095-8956(76)90004-6","article-title":"Degrees and matchings","volume":"20","author":"Chv\u00e1tal","year":"1976","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115159_br0060","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","article-title":"Some theorems on abstract graphs","volume":"3","author":"Dirac","year":"1952","journal-title":"Proc. Lond. Math. Soc."},{"key":"10.1016\/j.disc.2026.115159_br0070","doi-asserted-by":"crossref","DOI":"10.1016\/j.aam.2025.102936","article-title":"The number of edges in graphs with bounded clique number and circumference","volume":"171","author":"Dou","year":"2025","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/j.disc.2026.115159_br0080","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02024498","article-title":"On maximal paths and circuits of graphs","volume":"10","author":"Gallai","year":"1959","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"10.1016\/j.disc.2026.115159_br0090","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/jgt.23067","article-title":"On Tur\u00e1n problems with bounded matching number","volume":"106","author":"Gerbner","year":"2024","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115159_br0100","author":"Gerbner"},{"key":"10.1016\/j.disc.2026.115159_br0110","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2023.103807","article-title":"Extremal graphs without long paths and large cliques","volume":"119","author":"Katona","year":"2024","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115159_br0120","first-page":"19","article-title":"On maximal paths and cycles in a graph","volume":"234","author":"Kopylov","year":"1977","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/j.disc.2026.115159_br0130","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2024.113988","article-title":"Extremal graphs without long paths and a given graph","volume":"347","author":"Liu","year":"2024","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115159_br0140","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"},{"key":"10.1016\/j.disc.2026.115159_br0150","author":"Ma"},{"key":"10.1016\/j.disc.2026.115159_br0160","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.115159_br0170","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.laa.2023.03.026","article-title":"Spectral extrema of graphs with bounded clique number and matching number","volume":"669","author":"Wang","year":"2023","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.disc.2026.115159_br0180","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01902497","article-title":"Maximal circuits of graphs. I","volume":"28","author":"Woodall","year":"1976","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"10.1016\/j.disc.2026.115159_br0190","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1016\/j.dam.2025.08.029","article-title":"On generalized Tur\u00e1n number of graphs with bounded matching number","volume":"377","author":"Xue","year":"2025","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2026.115159_br0200","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2023.103728","article-title":"The maximum number of cliques in graphs with prescribed order, circumference and minimum degree","volume":"112","author":"Zhang","year":"2023","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115159_br0210","author":"Zhao"},{"key":"10.1016\/j.disc.2026.115159_br0220","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/jgt.23210","article-title":"Extremal problems for a matching and any other graph","volume":"109","author":"Zhu","year":"2025","journal-title":"J. Graph Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26001834?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26001834?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T12:55:57Z","timestamp":1778590557000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X26001834"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":22,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["S0012365X26001834"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115159","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Many cliques in graphs with bounded matching number and circumference","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115159","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":"115159"}}