{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:16Z","timestamp":1740107116497,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,2,25]],"date-time":"2023-02-25T00:00:00Z","timestamp":1677283200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,25]],"date-time":"2023-02-25T00:00:00Z","timestamp":1677283200000},"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"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s00373-023-02625-z","type":"journal-article","created":{"date-parts":[[2023,2,25]],"date-time":"2023-02-25T09:03:18Z","timestamp":1677315798000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Ramsey Number for a Forest Versus Disjoint Union of Complete Graphs"],"prefix":"10.1007","volume":"39","author":[{"given":"Sinan","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuejian","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,25]]},"reference":[{"key":"2625_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s00493-013-2778-4","volume":"33","author":"P Allen","year":"2013","unstructured":"Allen, P., Brightwell, G., Skokan, J.: Ramsey-goodness\u2014and otherwise. Combinatorica 33, 125\u2013160 (2013)","journal-title":"Combinatorica"},{"key":"2625_CR2","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1017\/S0963548317000554","volume":"27","author":"I Balla","year":"2018","unstructured":"Balla, I., Pokrovskiy, A., Sudakov, B.: Ramsey goodness of bounded degree trees. Combin. Prob. Comput. 27, 289\u2013309 (2018)","journal-title":"Combin. Prob. Comput."},{"key":"2625_CR3","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1112\/jlms\/s2-24.3.405","volume":"24","author":"S Burr","year":"1981","unstructured":"Burr, S.: Ramsey numbers involving graphs with long suspended paths. J. Lond. Math. Soc. 24, 405\u2013413 (1981)","journal-title":"J. Lond. Math. Soc."},{"key":"2625_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1002\/jgt.3190070106","volume":"7","author":"S Burr","year":"1983","unstructured":"Burr, S., Erd\u0151s, P.: Generalizations of a Ramsey-theoretic result of Chv\u00e1tal. J. Graph Theory 7, 39\u201351 (1983)","journal-title":"J. Graph Theory"},{"key":"2625_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1002\/jgt.3190010118","volume":"1","author":"V Chv\u00e1tal","year":"1977","unstructured":"Chv\u00e1tal, V.: Tree-complete graph Ramsey numbers. J. Graph Theory 1, 93 (1977)","journal-title":"J. Graph Theory"},{"key":"2625_CR6","doi-asserted-by":"publisher","first-page":"335","DOI":"10.2140\/pjm.1972.41.335","volume":"41","author":"V Chv\u00e1tal","year":"1972","unstructured":"Chv\u00e1tal, V., Harary, F.: Generalized Ramsey theory for graphs, III. Small Off-diagonal numbers. Pac. J. Math. 41, 335\u2013345 (1972)","journal-title":"Pac. J. Math."},{"doi-asserted-by":"crossref","unstructured":"Conlon, D., Fox, J., Sudakov, B.: Recent Developments in Graph Ramsey Theory. Surveys in combinatorics 2015, 49\u2013118, London Math. Soc. Lecture Note Ser. 424, Cambridge Univ. Press, Cambridge (2015)","key":"2625_CR7","DOI":"10.1017\/CBO9781316106853.003"},{"key":"2625_CR8","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1002\/jgt.3190060405","volume":"6","author":"R Gould","year":"1982","unstructured":"Gould, R., Jacobson, M.: Bounds for the Ramsey number of a disconnected graph versus any graph. J. Graph Theory 6, 413\u2013417 (1982)","journal-title":"J. Graph Theory"},{"unstructured":"Hu, S., Peng, Y.: The Ramsey numbers of a stripe versus trees and unicyclic graphs, preprint","key":"2625_CR9"},{"issue":"5","key":"2625_CR10","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1016\/j.ejc.2009.10.011","volume":"31","author":"Q Lin","year":"2010","unstructured":"Lin, Q., Li, Y., Dong, L.: Ramsey goodness and generalized stars. Eur. J. Combin. 31(5), 1228\u20131234 (2010)","journal-title":"Eur. J. Combin."},{"key":"2625_CR11","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/j.jctb.2016.06.009","volume":"122","author":"A Pokrovskiy","year":"2017","unstructured":"Pokrovskiy, A., Sudakov, B.: Ramsey goodness of paths. J. Combin. Theory Ser. B 122, 384\u2013390 (2017)","journal-title":"J. Combin. Theory Ser. B"},{"unstructured":"Radziszowski, S.: Small Ramsey numbers. Electron. J. Combin. DS1 12 (2017) http:\/\/www.combinatorics.org","key":"2625_CR12"},{"key":"2625_CR13","doi-asserted-by":"publisher","first-page":"585","DOI":"10.4153\/CJM-1975-069-0","volume":"27","author":"S Stahl","year":"1975","unstructured":"Stahl, S.: On the Ramsey number $$r(F, K_m)$$ where $$F$$ is a forest. Can. J. Math. 27, 585\u2013589 (1975)","journal-title":"Can. J. Math."},{"key":"2625_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.22342\/jims.20.1.179.31-35","volume":"20","author":"I Sudarsana","year":"2014","unstructured":"Sudarsana, I.: The goodness of long path with respect to multiple copies of complete graphs. J. Indones. Math. Soc. 20, 31\u201335 (2014)","journal-title":"J. Indones. Math. Soc."},{"doi-asserted-by":"crossref","unstructured":"Sudarsana, I., Adiwijaya, Musdalifah, S.: The Ramsey Number for a Linear Forest versus Two Identical Copies of Complete Graphs. Computing and combinatorics, 209\u2013215, Lecture Notes in Comput. Sci., 6196, Springer, Berlin (2010)","key":"2625_CR15","DOI":"10.1007\/978-3-642-14031-0_24"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02625-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-023-02625-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02625-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T17:04:57Z","timestamp":1681319097000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-023-02625-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,25]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["2625"],"URL":"https:\/\/doi.org\/10.1007\/s00373-023-02625-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2023,2,25]]},"assertion":[{"value":"18 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2023","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":"26"}}