{"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":1740107116790,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T00:00:00Z","timestamp":1680739200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T00:00:00Z","timestamp":1680739200000},"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":["12171088"],"award-info":[{"award-number":["12171088"]}],"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,5]]},"DOI":"10.1007\/s00373-023-02640-0","type":"journal-article","created":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T16:02:37Z","timestamp":1680796957000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Three-Color Ramsey Number of an Odd Cycle Versus Bipartite Graphs with Small Bandwidth"],"prefix":"10.1007","volume":"39","author":[{"given":"Chunlin","family":"You","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qizhong","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,6]]},"reference":[{"key":"2640_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 and otherwise. Combinatorica 33, 125\u2013160 (2013)","journal-title":"Combinatorica"},{"key":"2640_CR2","unstructured":"Alon, N., Fox, J., Zhao, Y.: Efficient arithmetic regularity and removal lemmas for induced bipartite patterns. Discrete Anal. Paper No. 3, p. 14 (2019)"},{"key":"2640_CR3","unstructured":"Balogh, J., Kostochka, A., Lavrov, M., Liu, X.: Monochromatic paths and cycles in $$2$$-edge-colored graphs with large minimum degree. arXiv:1906.02854"},{"key":"2640_CR4","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1016\/j.jctb.2008.12.002","volume":"99","author":"FS Benevides","year":"2009","unstructured":"Benevides, F.S., 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":"2640_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1017\/S0963548312000090","volume":"21","author":"FS Benevides","year":"2012","unstructured":"Benevides, F.S., Luczak, T., Scott, A., Skokan, J., White, M.: Monochromatic cycles in 2-coloured graphs. Combin. Probab. Comput. 21, 57\u201387 (2012)","journal-title":"Combin. Probab. Comput."},{"key":"2640_CR6","doi-asserted-by":"publisher","first-page":"209","DOI":"10.7151\/dmgt.1442","volume":"29","author":"H Bielak","year":"2009","unstructured":"Bielak, H.: Multicolor Ramsey numbers for some paths and cycles. Discuss. Math. Graph Theory 29, 209\u2013218 (2009)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2640_CR7","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/S0095-8956(73)80005-X","volume":"14","author":"JA Bondy","year":"1973","unstructured":"Bondy, J.A., Erd\u0151s, P.: Ramsey numbers for cycles in graphs. J. Combin. Theory Ser. B 14, 46\u201354 (1973)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2640_CR8","unstructured":"B\u00f6ttcher, J.: Embedding large graphs\u2013The Bollob\u00e1s-Koml\u00f3s conjecture and beyond. Ph.D. thesis, Technischen Universit\u00e4t M\u00fcnchen (2009)"},{"key":"2640_CR9","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1016\/j.ejc.2009.10.010","volume":"31","author":"J B\u00f6ttcher","year":"2010","unstructured":"B\u00f6ttcher, J., Pruessmann, K.P., Taraz, A., W\u00fcrfl, A.: Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs. Eur. J. Combin. 31, 1217\u20131227 (2010)","journal-title":"Eur. J. Combin."},{"key":"2640_CR10","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1137\/090765481","volume":"24","author":"J B\u00f6ttcher","year":"2010","unstructured":"B\u00f6ttcher, J., Heinig, P., Taraz, A.: Embedding into bipartite graphs. SIAM J. Discrete Math. 24, 1215\u20131233 (2010)","journal-title":"SIAM J. Discrete Math."},{"key":"2640_CR11","doi-asserted-by":"crossref","unstructured":"Chen, X., Lin, Q., You, C.: Ramsey numbers of large books. J. Graph Theory 101(1), 124\u2013133 (2022)","DOI":"10.1002\/jgt.22815"},{"key":"2640_CR12","doi-asserted-by":"crossref","unstructured":"Conlon, D., Fox, J., Wigderson, Y.: Ramsey number of books and quasirandomness. Combinatorica 42(1), 309\u2013363 (2022)","DOI":"10.1007\/s00493-021-4409-9"},{"key":"2640_CR13","first-page":"12","volume":"3","author":"D Conlon","year":"2019","unstructured":"Conlon, D.: The Ramsey number of books. Adv. Combin. 3, 12 (2019)","journal-title":"Adv. Combin."},{"key":"2640_CR14","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1007\/s00039-012-0171-x","volume":"22","author":"D Conlon","year":"2012","unstructured":"Conlon, D., Fox, J.: Bounds for graph regularity and removal lemmas. Geom. Funct. Anal. 22, 1191\u20131256 (2012)","journal-title":"Geom. Funct. Anal."},{"key":"2640_CR15","doi-asserted-by":"publisher","first-page":"4955","DOI":"10.1016\/j.disc.2008.04.053","volume":"309","author":"T Dzido","year":"2009","unstructured":"Dzido, T., Fidytek, R.: On some three color Ramsey numbers for paths and cycles. Discrete Math. 309, 4955\u20134958 (2009)","journal-title":"Discrete Math."},{"key":"2640_CR16","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 Math. Hungar. 10, 337\u2013356 (1959)","journal-title":"Acta Math. Hungar."},{"key":"2640_CR17","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/0095-8956(76)90016-2","volume":"20","author":"P Erd\u0151s","year":"1976","unstructured":"Erd\u0151s, P., Faudree, R.J., Rousseau, C.C., Schelp, R.H.: Generalized Ramsey theory for multiple colors. J. Combin. Theory Ser. B 20, 250\u2013264 (1976)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2640_CR18","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0012-365X(74)90151-4","volume":"8","author":"RJ Faudree","year":"1974","unstructured":"Faudree, R.J., Schelp, R.H.: All Ramsey numbers for cycles in graphs. Discrete Math. 8, 313\u2013329 (1974)","journal-title":"Discrete Math."},{"key":"2640_CR19","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0095-8956(75)90080-5","volume":"19","author":"RJ Faudree","year":"1975","unstructured":"Faudree, R.J., Schelp, R.H.: Path Ramsey numbers in multicolorings. J. Combin. Theory Ser. B 19, 150\u2013160 (1975)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2640_CR20","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0012-365X(74)90122-8","volume":"10","author":"RJ Faudree","year":"1974","unstructured":"Faudree, R.J., Lawrence, S.L., Parsons, T.D., Schelp, R.H.: Path-Cycle Ramsey numbers. Discrete Math. 10, 269\u2013277 (1974)","journal-title":"Discrete Math."},{"key":"2640_CR21","unstructured":"Ferguson, D.G.: The Ramsey number of mixed-parity cycles I. arXiv:1508.07154"},{"key":"2640_CR22","unstructured":"Ferguson, D.G.: The Ramsey number of mixed-parity cycles II. arXiv:1508.07171"},{"key":"2640_CR23","unstructured":"Ferguson, D.G.: The Ramsey number of mixed-parity cycles III. arXiv:1508.07176"},{"key":"2640_CR24","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":"2640_CR25","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 numbers for a triple of long cycles. Combinatorica 38, 827\u2013845 (2018)","journal-title":"Combinatorica"},{"key":"2640_CR26","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1017\/S0963548317000049","volume":"26","author":"J Fox","year":"2017","unstructured":"Fox, J., Lov\u00e1sz, L.M., Zhao, Y.: On regularity lemmas and their algorithmic applications. Combin. Probab. Comput. 26, 481\u2013505 (2017)","journal-title":"Combin. Probab. Comput."},{"key":"2640_CR27","first-page":"167","volume":"10","author":"L Gerencs\u00e9r","year":"1967","unstructured":"Gerencs\u00e9r, L., Gyarf\u00e1s, A.: On Ramsey-type problems. Ann. Univ. Sci. Budapest. E\u00f6tv\u00f6s Sect. Math. 10, 167\u2013170 (1967)","journal-title":"Ann. Univ. Sci. Budapest. E\u00f6tv\u00f6s Sect. Math."},{"key":"2640_CR28","first-page":"77","volume-title":"Ramsey Theory: Yesterday, Today and Tomorrow","author":"A Gy\u00e1rf\u00e1s","year":"2010","unstructured":"Gy\u00e1rf\u00e1s, A.: Large monochromatic components in edge colorings of graphs: a survey. In: Soifer, A. (ed.) Ramsey Theory: Yesterday, Today and Tomorrow, pp. 77\u201396. Birkh\u00e4user, Basel (2010)"},{"key":"2640_CR29","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\u00f6zy, G.N.: Star versus two stripes Ramsey numbers and a conjecture of Schelp. Combin. Probab. Comput. 21, 179\u2013186 (2012)","journal-title":"Combin. Probab. Comput."},{"key":"2640_CR30","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\u00f6zy, N., Szemer\u00e9di, E.: Three-color Ramsey numbers for Paths. Combinatorica 27, 35\u201369 (2007)","journal-title":"Combinatorica"},{"key":"2640_CR31","doi-asserted-by":"publisher","first-page":"46","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, 46 (2021)","journal-title":"Adv. Math."},{"key":"2640_CR32","doi-asserted-by":"publisher","first-page":"1.26","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, 1.26 (2019)","journal-title":"Electron. J. Combin."},{"key":"2640_CR33","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":"2640_CR34","unstructured":"Koml\u00f3s, J., Simonovits, M.: Szemer\u00e9di\u2019s regularity lemma and its applications in graph theory. Combinatorics, Paul Erd\u0151s is eighty, Vol. 2 (Keszthely, 1993), Bolyai Soc. Math. Stud., 2, J\u00e1nos Bolyai Math. Soc., Budapest, pp. 295\u2013352 (1996)"},{"key":"2640_CR35","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1137\/21M1390566","volume":"35","author":"Q Lin","year":"2021","unstructured":"Lin, Q., Peng, X.: Large book-cycle Ramsey numbers. SIAM J. Discrete Math. 35, 532\u2013545 (2021)","journal-title":"SIAM J. Discrete Math."},{"key":"2640_CR36","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":"2640_CR37","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":"2640_CR38","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.ejc.2015.02.018","volume":"48","author":"G Mota","year":"2015","unstructured":"Mota, G., S\u00e1rk\u00f6zy, G.N., Schacht, M., Taraz, A.: Ramsey number for bipartite graphs with small bandwidth. Eur. J. Combin. 48, 165\u2013176 (2015)","journal-title":"Eur. J. Combin."},{"key":"2640_CR39","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00493-009-2409-2","volume":"29","author":"V Nikiforov","year":"2009","unstructured":"Nikiforov, V., Rousseau, C.C.: Ramsey goodness and beyond. Combinatorica 29, 227\u2013262 (2009)","journal-title":"Combinatorica"},{"key":"2640_CR40","doi-asserted-by":"publisher","first-page":"24","DOI":"10.37236\/511","volume":"18","author":"GR Omidi","year":"2011","unstructured":"Omidi, G.R., Raeisi, G.: On multicolor Ramsey number of paths versus cycles. Electron. J. Combin. 18, 24 (2011)","journal-title":"Electron. J. Combin."},{"key":"2640_CR41","doi-asserted-by":"crossref","unstructured":"R\u00f6dl, V., Schacht, M.: Regularity Lemmas for Graphs. Fete of Combinatorics and Computer Science. Bolyai Soc. Math. Stud., 20, J\u00e1nos Bolyai Math. Soc., Budapest, pp. 287\u2013325 (2010)","DOI":"10.1007\/978-3-642-13580-4_11"},{"key":"2640_CR42","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0095-8956(73)90036-1","volume":"15","author":"V Rosta","year":"1973","unstructured":"Rosta, V.: On a Ramsey-type problem of J. A. Bondy and P. Erd\u0151s I, II. J. Combin. Theory Ser. B 15, 105\u2013120 (1973)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2640_CR43","doi-asserted-by":"publisher","first-page":"3","DOI":"10.37236\/5663","volume":"23","author":"GN S\u00e1rkozy","year":"2016","unstructured":"S\u00e1rkozy, G.N.: On the multi-colored Ramsey numbers of paths and even cycles. Electron. J. Combin. 23, 3 (2016)","journal-title":"Electron. J. Combin."},{"key":"2640_CR44","doi-asserted-by":"publisher","first-page":"2158","DOI":"10.1016\/j.disc.2011.09.015","volume":"312","author":"RH Schelp","year":"2012","unstructured":"Schelp, R.H.: Some Ramsey-Tur\u00e1n type problems and related questions. Discrete Math. 312, 2158\u20132161 (2012)","journal-title":"Discrete Math."},{"key":"2640_CR45","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/j.ejc.2008.05.008","volume":"30","author":"Z Shao","year":"2009","unstructured":"Shao, Z., Xu, X., Shi, X., Pan, L.: Some three-color Ramsey numbers, $$R(P_4, P_5, C_k)$$ and $$R(P_4, P_6, C_k)$$. Eur. J. Combin. 30, 396\u2013403 (2009)","journal-title":"Eur. J. Combin."},{"key":"2640_CR46","unstructured":"Szemer\u00e9di, E.: Regular Partitions of Graphs, Probl\u00e8mes combinatoires et th\u00e9orie des graphes (Colloq. Internat. CNRS, Univ. Orsay, 1976), Colloq. Internat. CNRS, 260, CNRS, Paris, pp. 399\u2013401 (1978)"},{"key":"2640_CR47","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s40304-015-0062-1","volume":"3","author":"E Szemer\u00e9di","year":"2015","unstructured":"Szemer\u00e9di, E.: Arithmetic progressions, different regularity lemmas and removal lemmas. Commun. Math. Stat. 3, 315\u2013328 (2015)","journal-title":"Commun. Math. Stat."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02640-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-023-02640-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02640-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,28]],"date-time":"2023-05-28T17:02:13Z","timestamp":1685293333000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-023-02640-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,6]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["2640"],"URL":"https:\/\/doi.org\/10.1007\/s00373-023-02640-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2023,4,6]]},"assertion":[{"value":"8 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2023","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 have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"46"}}