{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:30Z","timestamp":1759063650251,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,7,25]],"date-time":"2021-07-25T00:00:00Z","timestamp":1627171200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,25]],"date-time":"2021-07-25T00:00:00Z","timestamp":1627171200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100010909","name":"Young Scientists Fund","doi-asserted-by":"publisher","award":["11901001"],"award-info":[{"award-number":["11901001"]}],"id":[{"id":"10.13039\/501100010909","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010903","name":"Key Programme","doi-asserted-by":"publisher","award":["11931002"],"award-info":[{"award-number":["11931002"]}],"id":[{"id":"10.13039\/501100010903","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871377"],"award-info":[{"award-number":["11871377"]}],"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":[[2021,11]]},"DOI":"10.1007\/s00373-021-02386-7","type":"journal-article","created":{"date-parts":[[2021,7,25]],"date-time":"2021-07-25T09:02:52Z","timestamp":1627203772000},"page":"2703-2711","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Bipartite Ramsey Numbers of Cycles for Random Graphs"],"prefix":"10.1007","volume":"37","author":[{"given":"Meng","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusheng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,25]]},"reference":[{"key":"2386_CR1","volume-title":"The Probabilistic Method","author":"N Alon","year":"1992","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method. Wiley-Interscience, New York (1992)"},{"key":"2386_CR2","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1016\/j.jctb.2008.12.002","volume":"99","author":"F Benevides","year":"2009","unstructured":"Benevides, F., Skokan, J.: The 3-colored Ramsey number of even cycles. J. Combin. Theory Ser. B 99, 690\u2013708 (2009)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2386_CR3","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.: Three colour bipartite Ramsey number of cycles and paths. J. Graph Theory 92, 445\u2013459 (2019)","journal-title":"J. Graph Theory"},{"key":"2386_CR4","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H Chernoff","year":"1952","unstructured":"Chernoff, H.: A measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23, 493\u2013507 (1952)","journal-title":"Ann. Math. Stat."},{"key":"2386_CR5","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0095-8956(83)90037-0","volume":"34","author":"V Chv\u00e1tal","year":"1983","unstructured":"Chv\u00e1tal, V., R\u00f6dl, V., Szemer\u00e9di, E., Trotter Jr., W.T.: The Ramsey number of a graph with bounded maximum degree. J. Combin. Theory Ser. B 34, 239\u2013243 (1983)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2386_CR6","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.ejc.2017.03.002","volume":"63","author":"E Davies","year":"2017","unstructured":"Davies, E., Jenssen, M., Roberts, B.: Multicolour ramsey numbers of paths and even cycles. Eur. J. Combin. 63, 124\u2013133 (2017)","journal-title":"Eur. J. Combin."},{"key":"2386_CR7","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1017\/S096354831400056X","volume":"24","author":"A Dudek","year":"2015","unstructured":"Dudek, A., Pra\u0142at, P.: An alternative proof of the linearity of the size Ramsey number of paths. Combin. Probab. Comput. 24, 551\u2013555 (2015)","journal-title":"Combin. Probab. Comput."},{"key":"2386_CR8","doi-asserted-by":"publisher","first-page":"2079","DOI":"10.1137\/16M1069717","volume":"31","author":"A Dudek","year":"2017","unstructured":"Dudek, A., Pra\u0142at, P.: On some multicolor Ramsey properties of random graphs. SIAM J. Discrete Math. 31, 2079\u20132092 (2017)","journal-title":"SIAM J. Discrete Math."},{"key":"2386_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0012-365X(74)90151-4","volume":"8","author":"R Faudree","year":"1974","unstructured":"Faudree, R., Schelp, R.: All Ramsey numbers for cycles in graphs. Discrete Math. 8, 313\u2013329 (1974)","journal-title":"Discrete Math."},{"key":"2386_CR10","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1016\/j.jctb.2006.09.001","volume":"97","author":"A Figaj","year":"2007","unstructured":"Figaj, A., \u0141uczak, T.: The Ramsey number for a triple of long even cycles. J. Combin. Theory Ser. B 97, 584\u2013596 (2007)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2386_CR11","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/s00493-016-2433-y","volume":"38","author":"A Figaj","year":"2018","unstructured":"Figaj, A., \u0141uczak, T.: The Ramsey number for a triple of long cycles. Combinatorica 38, 827\u2013845 (2018)","journal-title":"Combinatorica"},{"key":"2386_CR12","first-page":"167","volume":"10","author":"L Gerencs\u00e9r","year":"1967","unstructured":"Gerencs\u00e9r, L., Gy\u00e1rf\u00e1s, A.: On Ramsey-type problems. Ann. Univ. E\u0151tv\u0151s Sect. Math. 10, 167\u2013170 (1967)","journal-title":"Ann. Univ. E\u0151tv\u0151s Sect. Math."},{"key":"2386_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/jgt.3190080109","volume":"8","author":"A Gy\u00e1rf\u00e1s","year":"1984","unstructured":"Gy\u00e1rf\u00e1s, A., Rousseau, C., Schelp, R.: An extremal problem for paths in bipartite graphs. J. Graph Theory 8, 83\u201395 (1984)","journal-title":"J. Graph Theory"},{"key":"2386_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s00493-007-0043-4","volume":"27","author":"A Gy\u00e1rf\u00e1s","year":"2007","unstructured":"Gy\u00e1rf\u00e1s, A., Ruszink\u00f3, M., S\u00e1rk\u0151zy, G., Szemer\u00e9di, E.: Three-color Ramsey numbers for paths. Combinatorica 27, 35\u201369 (2007)","journal-title":"Combinatorica"},{"key":"2386_CR15","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1002\/jgt.20231","volume":"55","author":"A Gy\u00e1rf\u00e1s","year":"2007","unstructured":"Gy\u00e1rf\u00e1s, A., Ruszink\u00f3, M., S\u00e1rk\u0151zy, G., Szemer\u00e9di, E.: Tripartite Ramsey numbers for paths. J. Graph Theory 55, 164\u2013174 (2007)","journal-title":"J. Graph Theory"},{"key":"2386_CR16","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1017\/S0963548311000599","volume":"21","author":"A Gy\u00e1rf\u00e1s","year":"2012","unstructured":"Gy\u00e1rf\u00e1s, A., S\u00e1rk\u0151zy, G.: Star versus two stripes Ramsey numbers and a conjecture of Schelp. Combin. Probab. Comput. 21, 179\u2013186 (2012)","journal-title":"Combin. Probab. Comput."},{"key":"2386_CR17","volume-title":"Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"S Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York (2000)"},{"key":"2386_CR18","doi-asserted-by":"publisher","first-page":"107444","DOI":"10.1016\/j.aim.2020.107444","volume":"376","author":"M Jenssen","year":"2021","unstructured":"Jenssen, M., Skokan, J.: Exact Ramsey numbers of odd cycles via nonlinear optimisation. Adv. Math. 376, 107444 (2021)","journal-title":"Adv. Math."},{"key":"2386_CR19","doi-asserted-by":"publisher","first-page":"126","DOI":"10.37236\/7614","volume":"26","author":"C Knierim","year":"2019","unstructured":"Knierim, C., Su, P.: Improved bounds on the multicolor Ramsey numbers of paths and even cycles. Electron. J. Combin. 26, 126 (2019)","journal-title":"Electron. J. Combin."},{"key":"2386_CR20","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.endm.2005.05.053","volume":"19","author":"Y Kohayakawa","year":"2005","unstructured":"Kohayakawa, Y., Simonovits, M., Skokan, J.: The 3-colored Ramsey number of odd cycles. Electron. Notes Discrete Math. 19, 397\u2013402 (2005)","journal-title":"Electron. Notes Discrete Math."},{"key":"2386_CR21","doi-asserted-by":"publisher","first-page":"5041","DOI":"10.1016\/j.aim.2011.01.004","volume":"226","author":"Y Kohayakawa","year":"2011","unstructured":"Kohayakawa, Y., R\u00f6dl, V., Schacht, M., Szemer\u00e9di, E.: Sparse partition universal graphs for graphs of bounded degree. Adv. Math. 226, 5041\u20135065 (2011)","journal-title":"Adv. Math."},{"key":"2386_CR22","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1017\/S0963548315000279","volume":"25","author":"S Letzter","year":"2016","unstructured":"Letzter, S.: Path Ramsey number for random graphs. Combin. Probab. Comput. 25, 612\u2013622 (2016)","journal-title":"Combin. Probab. Comput."},{"key":"2386_CR23","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. Combin. Theory Ser. B 75, 174\u2013187 (1999)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2386_CR24","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1002\/jgt.20572","volume":"69","author":"T \u0141uczak","year":"2012","unstructured":"\u0141uczak, T., Simonovits, M., Skokan, J.: On the multi-colored Ramsey numbers of cycles. J. Graph Theory 69, 169\u2013175 (2012)","journal-title":"J. Graph Theory"},{"key":"2386_CR25","doi-asserted-by":"publisher","first-page":"1988","DOI":"10.1137\/130947647","volume":"29","author":"Q Lin","year":"2015","unstructured":"Lin, Q., Li, Y.: A folkman linear family. SIAM J. Discrete Math. 29, 1988\u20131998 (2015)","journal-title":"SIAM J. Discrete Math."},{"key":"2386_CR26","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1007\/s10878-017-0214-1","volume":"35","author":"Q Lin","year":"2018","unstructured":"Lin, Q., Li, Y.: Sparse multipartite graphs as partition universal for graphs with bounded degree. J. Comb. Optim. 35, 724\u2013739 (2018)","journal-title":"J. Comb. Optim."},{"key":"2386_CR27","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/0095-8956(73)90035-X","volume":"15","author":"V Rosta","year":"1973","unstructured":"Rosta, V.: On a Ramsey-type problem of J. A. Bondy and P. Erd\u0151s. J. Combin. Theory Ser. B 15, 94\u2013120 (1973)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2386_CR28","doi-asserted-by":"publisher","first-page":"3.53","DOI":"10.37236\/5663","volume":"23","author":"G S\u00e1rk\u00f6zy","year":"2016","unstructured":"S\u00e1rk\u00f6zy, G.: On the multi-colored Ramsey numbers of paths and even cycles. Electron. J. Combin. 23, 3.53 (2016)","journal-title":"Electron. J. Combin."},{"key":"2386_CR29","doi-asserted-by":"publisher","first-page":"2.16","DOI":"10.37236\/7334","volume":"25","author":"L Shen","year":"2018","unstructured":"Shen, L., Lin, Q., Liu, Q.: Bipartite Ramsey numbers for bipartite graphs of small bandwidth. Electron. J. Combin. 25, 2.16 (2018)","journal-title":"Electron. J. Combin."},{"key":"2386_CR30","unstructured":"Szemer\u00e9di, E.: Regular partitions of graphs, Probl\u00e9mes combinatories et th\u00e9orie des graphs, Orsay 1976, J.C. Bermond, J.C. Fournier, M. Las Vergnas, D. Scotteau, (Editors), Colloq. Internat. CNRS 260, Paris (1978)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02386-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-021-02386-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02386-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T21:30:28Z","timestamp":1636839028000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-021-02386-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,25]]},"references-count":30,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["2386"],"URL":"https:\/\/doi.org\/10.1007\/s00373-021-02386-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2021,7,25]]},"assertion":[{"value":"15 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}