{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:26Z","timestamp":1740107126830,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T00:00:00Z","timestamp":1722988800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T00:00:00Z","timestamp":1722988800000},"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","12371327"],"award-info":[{"award-number":["11931002","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":[[2024,10]]},"DOI":"10.1007\/s00373-024-02821-5","type":"journal-article","created":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T09:02:16Z","timestamp":1723021336000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Ramsey Numbers of Multiple Copies of Graphs in a Component"],"prefix":"10.1007","volume":"40","author":[{"given":"Caixia","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuejian","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiran","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,7]]},"reference":[{"issue":"1\u20132","key":"2821_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1017\/S0963548312000090","volume":"21","author":"FS Benevides","year":"2012","unstructured":"Benevides, F.S., \u0141uczak, T., Scott, A., et al.: Monochromatic cycles in 2-coloured graphs. Comb. Prob. Comput. 21(1\u20132), 57\u201387 (2012)","journal-title":"Comb. Prob. Comput."},{"issue":"4","key":"2821_CR2","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1002\/jgt.22463","volume":"92","author":"M Buci\u0107","year":"2019","unstructured":"Buci\u0107, M., Letzter, S., Sudakov, B.: 3-Color bipartite Ramsey number of cycles and paths. J. Graph Theory 92(4), 445\u2013459 (2019)","journal-title":"J. Graph Theory"},{"issue":"3","key":"2821_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0012-365X(87)90053-7","volume":"65","author":"S Burr","year":"1987","unstructured":"Burr, S.: On the Ramsey numbers $$r(G, nH)$$ and $$r(nG, nH)$$ when $$n$$ is large. Disc. Math. 65(3), 215\u2013229 (1987)","journal-title":"Disc. Math."},{"key":"2821_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1090\/S0002-9947-1975-0409255-0","volume":"209","author":"S Burr","year":"1975","unstructured":"Burr, S., Erd\u0151s, P., Spencer, J.: Ramsey theorems for multiple copies of graphs. Trans. Am. Math. Soc. 209, 87\u201399 (1975)","journal-title":"Trans. Am. Math. Soc."},{"issue":"2","key":"2821_CR5","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1090\/S0002-9939-1972-0332559-X","volume":"32","author":"V Chv\u00e1tal","year":"1972","unstructured":"Chv\u00e1tal, V., Harary, F.: Generalized Ramsey theory for graphs, II. Small diagonal numbers. Proc. Am. Math. Soc. 32(2), 389\u2013394 (1972)","journal-title":"Proc. Am. Math. Soc."},{"issue":"2","key":"2821_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/jgt.21913","volume":"83","author":"A Gy\u00e1rf\u00e1s","year":"2016","unstructured":"Gy\u00e1rf\u00e1s, A., S\u00e1rk\u00f6zy, G.N.: Ramsey number of a connected triangle matching. J. Graph Theory 83(2), 109\u2013119 (2016)","journal-title":"J. Graph Theory"},{"issue":"2","key":"2821_CR7","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1006\/jctb.1998.1874","volume":"75","author":"T \u0141uczak","year":"1999","unstructured":"\u0141uczak, T.: $$R(C_n, C_n, C_n) \\le (4+o(1))n$$. J. Comb. Theory Ser. B 75(2), 174\u2013187 (1999)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2821_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jctb.2019.11.002","volume":"143","author":"T \u0141uczak","year":"2020","unstructured":"\u0141uczak, T., Rahimi, Z.: On Schelp\u2019s problem for three odd long cycles. J. Comb. Theory Ser. B 143, 1\u201315 (2020)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"2821_CR9","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0012-365X(88)90056-8","volume":"69","author":"H Mizuno","year":"1988","unstructured":"Mizuno, H., Sato, I.: Ramsey numbers for unions of some cycles. Disc. Math. 69(3), 283\u2013294 (1988)","journal-title":"Disc. Math."},{"key":"2821_CR10","unstructured":"Radziszowski, S. P.: Small Ramsey numbers. Electron. J. Comb. DSI, 15 (0017)"},{"issue":"1","key":"2821_CR11","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"2","author":"FP Ramsey","year":"1930","unstructured":"Ramsey, F.P.: On a problem of formal logic. Proc. Lond. Math. Soc. 2(1), 264\u2013286 (1930)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"1","key":"2821_CR12","first-page":"8","volume":"24","author":"B Roberts","year":"2017","unstructured":"Roberts, B.: Ramsey numbers of connected clique matchings. Electron. J. Comb. 24(1), 8 (2017)","journal-title":"Electron. J. Comb."},{"issue":"6","key":"2821_CR13","first-page":"66","volume":"20","author":"LD Yong","year":"1999","unstructured":"Yong, L.D., Jian, W.Z.: The Ramsey number $$r(mC_4, nC_4)$$ (in Chinese). J. Shanghai Tiedao Univ. 20(6), 66\u201370 (1999)","journal-title":"J. Shanghai Tiedao Univ."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02821-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02821-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02821-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T15:03:50Z","timestamp":1729782230000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02821-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,7]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["2821"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02821-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2024,8,7]]},"assertion":[{"value":"20 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2024","order":4,"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":"94"}}