{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T06:40:09Z","timestamp":1746254409767,"version":"3.40.4"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:00:00Z","timestamp":1742947200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:00:00Z","timestamp":1742947200000},"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":["12401449"],"award-info":[{"award-number":["12401449"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005693","name":"Hainan University","doi-asserted-by":"publisher","award":["No. KYQD(ZR)-23155"],"award-info":[{"award-number":["No. KYQD(ZR)-23155"]}],"id":[{"id":"10.13039\/501100005693","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,4]]},"DOI":"10.1007\/s00373-025-02914-9","type":"journal-article","created":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T17:06:43Z","timestamp":1743268003000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extremal Graphs for the Union of Two Vertex-Disjoint Cliques"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-6195-147X","authenticated-orcid":false,"given":"Zhidan","family":"Luo","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,26]]},"reference":[{"key":"2914_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00373-022-02467-1","volume":"38","author":"W Chen","year":"2022","unstructured":"Chen, W., Lu, C., Yuan, L.: Extremal graphs for two vertex-disjoint copies of a clique. Graphs Combin. 38, 67 (2022)","journal-title":"Graphs Combin."},{"key":"2914_CR2","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/BF01650069","volume":"13","author":"P Erd\u0151s","year":"1962","unstructured":"Erd\u0151s, P.: \u00fcber ein Extremalproblem in der Graphentheorie. Archiv der Mathematik 13, 222\u2013227 (1962)","journal-title":"Archiv der Mathematik"},{"key":"2914_CR3","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02024498","volume":"10","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., Gallai, T.: On maximal paths and circuits of graphs. Acta Mathematica Academiae Scientiarum Hungarica 10, 337\u2013356 (1959)","journal-title":"Acta Mathematica Academiae Scientiarum Hungarica"},{"key":"2914_CR4","doi-asserted-by":"publisher","first-page":"759","DOI":"10.21136\/CMJ.2024.0461-23","volume":"74","author":"C Hu","year":"2024","unstructured":"Hu, C.: Tur\u00e1n number of two vertex-disjoint copies of cliques. Czechoslov. Math. J. 74, 759\u2013769 (2024)","journal-title":"Czechoslov. Math. J."},{"unstructured":"Hajnal, A., Szemer\u00e9di, E.: Proof of a conjecture of P. Erd\u0151s. In: Erd\u0151s, P., R\u00e9nyi, A., S\u00f3s, V.T. (eds.) Combinatorial Theory and its Application, pp. 601\u2013623. North-Holland, London (1970)","key":"2914_CR5"},{"key":"2914_CR6","first-page":"60","volume":"10","author":"W Mantel","year":"1907","unstructured":"Mantel, W.: Problem 28. Wiskundige Opgaven 10, 60\u201361 (1907)","journal-title":"Wiskundige Opgaven"},{"key":"2914_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.4153\/CJM-1968-012-x","volume":"20","author":"J Moon","year":"1968","unstructured":"Moon, J.: On independent complete subgraphs in a graph. Can. J. Math. 20, 95\u2013102 (1968)","journal-title":"Can. J. Math."},{"key":"2914_CR8","first-page":"279","volume-title":"Theory of Graphs","author":"M Simonovits","year":"1968","unstructured":"Simonovits, M.: A method for solving extremal problems in graph theory. In: Erd\u0151s, P., Katona, G. (eds.) Theory of Graphs, pp. 279\u2013319. Academic Press, New York (1968)"},{"key":"2914_CR9","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: On an extremal problem in graph theory. Matematikai\u00e9s Fisikai Lapok 48, 436\u2013452 (1941)","journal-title":"Matematikai\u00e9s Fisikai Lapok"},{"key":"2914_CR10","volume-title":"Introduction to Graph Theory","author":"D West","year":"2001","unstructured":"West, D.: Introduction to Graph Theory. Prentice Hall, Hoboken (2001)"},{"key":"2914_CR11","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.dam.2024.01.003","volume":"347","author":"J Zhang","year":"2024","unstructured":"Zhang, J.: Extremal numbers for disjoint copies of a clique. Discrete Appl. Math. 347, 263\u2013270 (2024)","journal-title":"Discrete Appl. Math."},{"key":"2914_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2023.128521","volume":"468","author":"L Zhang","year":"2024","unstructured":"Zhang, L., Yin, J.: On the Tur\u00e1n number of $$K_{\\lambda _{1}}\\cup K_{\\lambda _{2}}$$. Appl. Math. Comput. 468, 128521 (2024)","journal-title":"Appl. Math. Comput."},{"key":"2914_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2024.113941","volume":"347","author":"L Zhang","year":"2024","unstructured":"Zhang, L., Yin, J.: The complete value of the Tur\u00e1n number of $$3K_{p+ 1}$$. Discrete Math. 347, 113941 (2024)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02914-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02914-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02914-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T06:17:06Z","timestamp":1746253026000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02914-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,26]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2914"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02914-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,3,26]]},"assertion":[{"value":"25 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2025","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":"51"}}