{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T05:50:44Z","timestamp":1775800244939,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,25]],"date-time":"2024-12-25T00:00:00Z","timestamp":1735084800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,25]],"date-time":"2024-12-25T00:00:00Z","timestamp":1735084800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11931002"],"award-info":[{"award-number":["11931002"]}],"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":["12371327"],"award-info":[{"award-number":["12371327"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s00373-024-02876-4","type":"journal-article","created":{"date-parts":[[2024,12,25]],"date-time":"2024-12-25T08:12:58Z","timestamp":1735114378000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Generalized Tur\u00e1n Numbers of Intersecting Cliques"],"prefix":"10.1007","volume":"41","author":[{"given":"Xiaoli","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Yuejian","family":"Peng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,25]]},"reference":[{"key":"2876_CR1","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/0097-3165(72)90103-3","volume":"12","author":"HL Abbott","year":"1972","unstructured":"Abbott, H.L., Hanson, D., Sauer, H.: Intersection theorems for systems of sets. J. Combin. Theory Ser. A 12, 381\u2013389 (1972)","journal-title":"J. Combin. Theory Ser. A"},{"key":"2876_CR2","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.jctb.2016.03.004","volume":"121","author":"N Alon","year":"2016","unstructured":"Alon, N., Shikhelman, C.: Many $$T$$ copies in $$H$$-free graphs. J. Combin. Theory Ser. B 121, 146\u2013172 (2016)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2876_CR3","doi-asserted-by":"publisher","first-page":"4176","DOI":"10.1016\/j.disc.2008.10.007","volume":"309","author":"N Balachandran","year":"2009","unstructured":"Balachandran, N., Khare, N.: Graphs with restricted valency and matching number. Discr. Math. 309, 4176\u20134180 (2009)","journal-title":"Discr. Math."},{"issue":"3","key":"2876_CR4","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1090\/proc\/16160","volume":"151","author":"D Brada\u0107","year":"2023","unstructured":"Brada\u0107, D., Buci\u010d, M., Sudakov, B.: Tur\u00e1n number of sunflower. Proc. Am. Math. Soc. 151(3), 961\u2013975 (2023)","journal-title":"Proc. Am. Math. Soc."},{"key":"2876_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0095-8956(03)00044-3","volume":"89","author":"G Chen","year":"2003","unstructured":"Chen, G., Gould, R., Pfender, F., Wei, B.: Extremal graphs for intersecting cliques. J. Combin. Theory Ser. B 89, 159\u2013171 (2003)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2876_CR6","unstructured":"Erd\u0151s, P.: On some new inequalities concerning extremal properties of graphs, in 1968 Theory of Graphs, pp. 77\u201381. Tihany, Proc.Colloq. (1966)"},{"key":"2876_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1006\/jctb.1995.1026","volume":"64","author":"P Erd\u0151s","year":"1995","unstructured":"Erd\u0151s, P., F\u00fcredi, Z., Gould, R., Gunderson, D.: Extremal graphs for intersecting triangles. J. Combin. Theory Ser. B 64, 89\u2013100 (1995)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2876_CR8","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1017\/S0963548314000601","volume":"24","author":"Z F\u00fcredi","year":"2015","unstructured":"F\u00fcredi, Z., Gunderson, D.S.: Extremal number for odd cycles. Comb. Probab. Comput. 24, 641\u2013645 (2015)","journal-title":"Comb. Probab. Comput."},{"issue":"7","key":"2876_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113395","volume":"346","author":"D Gerbner","year":"2023","unstructured":"Gerbner, D.: Generalized Tur\u00e1n problems for double stars. Discr. Math. 346(7), 113395 (2023)","journal-title":"Discr. Math."},{"key":"2876_CR10","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.jctb.2020.05.005","volume":"145","author":"D Gerbner","year":"2020","unstructured":"Gerbner, D., Gy\u0151ri, E., Methuku, A., Vizer, M.: Generalized Tur\u00e1n problems for even cycles. J. Combin. Theory Ser. B 145, 169\u2013213 (2020)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"11","key":"2876_CR11","doi-asserted-by":"publisher","first-page":"3130","DOI":"10.1016\/j.disc.2019.06.022","volume":"342","author":"D Gerbner","year":"2019","unstructured":"Gerbner, D., Methuku, A., Vizer, M.: Generalized Tur\u00e1n problems for disjoint copies of graphs. Discr. Math. 342(11), 3130\u20133141 (2019)","journal-title":"Discr. Math."},{"key":"2876_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2022.103519","volume":"103","author":"D Gerbner","year":"2022","unstructured":"Gerbner, D., Palmer, C.: Some exact results for generalized Tur\u00e1n problems. Eur. J. Comb. 103, 103519 (2022)","journal-title":"Eur. J. Comb."},{"key":"2876_CR13","doi-asserted-by":"crossref","unstructured":"Gernber, D.: Generalized Tur\u00e1n results for disjoint cliques, arXiv preprint, (2023), arXiv:2203.15964v1","DOI":"10.1016\/j.disc.2023.113710"},{"issue":"1","key":"2876_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113710","volume":"347","author":"D Gerbner","year":"2024","unstructured":"Gerbner, D., Patk\u00f3s, B.: Generalized Tur\u00e1n results for intersecting cliques. Discr. Math. 347(1), 113710 (2024)","journal-title":"Discr. Math."},{"key":"2876_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2021.103367","volume":"97","author":"B Lidick\u00fd","year":"2021","unstructured":"Lidick\u00fd, B., Murphy, K.: Maximizing five-cycles in $$K_r$$-free graphs. Eur. J. Comb. 97, 103367 (2021)","journal-title":"Eur. J. Comb."},{"key":"2876_CR16","unstructured":"Liu, E.L., Wang, J.: The generalized Tur\u00e1n problem of two intersecting cliques, arXiv preprint (2021), arXiv:2101.08004"},{"key":"2876_CR17","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.jctb.2017.08.005","volume":"128","author":"R Luo","year":"2018","unstructured":"Luo, R.: The maximum number of cliques in graphs without long cycles. J. Combin. Theory Ser. B 128, 219\u2013226 (2018)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2876_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2019.103026","volume":"84","author":"J Ma","year":"2020","unstructured":"Ma, J., Qiu, Y.: Some sharp results on the generalized Tur\u00e1n numbers. Eur. J. Comb. 84, 103026 (2020)","journal-title":"Eur. J. Comb."},{"key":"2876_CR19","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.jctb.2023.06.004","volume":"162","author":"N Morrison","year":"2023","unstructured":"Morrison, N., Nir, J.D., Norin, S., Rzazewski, P., Wesolek, A.: Every graph is eventually Tur\u00e1n-good. J. Combin. Theory Ser. B 162, 213\u2013243 (2023)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2876_CR20","unstructured":"Simonovits, M.: A method for solving extremal problems in graph theroy, stalitiy problems. In Theory of Graphs(Proc.Colloq.,Tihany,1966), pp. 279\u2013319. (1968)"},{"key":"2876_CR21","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: Eine Extremalaufgabe aus der Graphentheorie. Mat. Fiz. Lapok 48, 436\u2013452 (1941)","journal-title":"Mat. Fiz. Lapok"},{"issue":"2","key":"2876_CR22","first-page":"163","volume":"66","author":"AA Zykov","year":"1949","unstructured":"Zykov, A.A.: On some properties of linear complexes. Matematicheskii sbornik 66(2), 163\u2013188 (1949)","journal-title":"Matematicheskii sbornik"},{"key":"2876_CR23","doi-asserted-by":"publisher","first-page":"103793","DOI":"10.1016\/j.ejc.2023.103793","volume":"144","author":"XT Zhu","year":"2023","unstructured":"Zhu, X.T., Chen, Y.J., Gerbner, D., Gy\u0151ri, E., karim, H.H.: The maximum of triangles in $$F_k$$-free graphs. Eur. J. Comb. 144, 103793 (2023)","journal-title":"Eur. J. Comb."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02876-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02876-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02876-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T04:22:38Z","timestamp":1748319758000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02876-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,25]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2876"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02876-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,25]]},"assertion":[{"value":"18 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"9"}}