{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:13Z","timestamp":1740107113851,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T00:00:00Z","timestamp":1667347200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T00:00:00Z","timestamp":1667347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"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\/501100010905","name":"Major Research Plan","doi-asserted-by":"publisher","award":["11871377"],"award-info":[{"award-number":["11871377"]}],"id":[{"id":"10.13039\/501100010905","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":[[2022,12]]},"DOI":"10.1007\/s00373-022-02577-w","type":"journal-article","created":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T20:32:16Z","timestamp":1667421136000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Ramsey Numbers Involving an Odd Cycle and Large Complete Graphs in Three Colors"],"prefix":"10.1007","volume":"38","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":[[2022,11,2]]},"reference":[{"key":"2577_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF01581168","volume":"80","author":"N Alon","year":"1998","unstructured":"Alon, N., Kahale, N.: Approximating the independence number via the $$\\vartheta $$-function. Math. Programm. 80, 253\u2013264 (1998)","journal-title":"Math. Programm."},{"key":"2577_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s00493-005-0011-9","volume":"25","author":"N Alon","year":"2005","unstructured":"Alon, N., R\u00f6dl, V.: Sharp bounds for some multicolor Ramsey numbers. Combinatorica 25, 125\u2013141 (2005)","journal-title":"Combinatorica"},{"key":"2577_CR3","doi-asserted-by":"publisher","DOI":"10.1201\/9781439863879","volume-title":"Erd\u0151s on Graphs: His Legacy of Unsolved Problems","author":"F Chung","year":"1998","unstructured":"Chung, F., Graham, R.: Erd\u0151s on Graphs: His Legacy of Unsolved Problems. A. K Peters Ltd, Peters Ltd, Wellesley, (1998)"},{"key":"2577_CR4","unstructured":"Erd\u0151s, P., S\u00f3s, V.: Problems and results on Ramsey-Tur\u00e1n type theorems. In: Proceedings of of the West Coast Conference on Combinatorics, Graph Theory and Computing, Humboldt State University, Arcata, CA, 1979, Congressus Numer. Vol. XXVI, Utilitas Mathematics, Winnipeg, Man. pp. 17\u201323 (1980)"},{"key":"2577_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.37236\/9071","volume":"27","author":"X He","year":"2020","unstructured":"He, X., Wigderson, Y.: Multicolor Ramsey numbers via pseudorandom graphs. Electron. J. Combin. 27, 1 (2020)","journal-title":"Electron. J. Combin."},{"key":"2577_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-32439-3_10","volume-title":"Pseudo-Random Graphs. More Sets, Graphs and Numbers. Bolyai Society Mathematical Studies","author":"M Krivelevich","year":"2006","unstructured":"Krivelevich, M., Sudakov, B.: Pseudo-Random Graphs. More Sets, Graphs and Numbers. Bolyai Society Mathematical Studies, vol. 15, pp. 199\u2013262. Springer, Berlin (2006)"},{"key":"2577_CR7","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1023\/B:JOCO.0000017383.13275.17","volume":"7","author":"Y Li","year":"2003","unstructured":"Li, Y., Zang, W.: The independence number of graphs with a forbidden cycle and Ramsey numbers. J. Comb. Optim. 7, 353\u2013359 (2003)","journal-title":"J. Comb. Optim."},{"key":"2577_CR8","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0012-365X(91)90112-F","volume":"91","author":"A Nilli","year":"1991","unstructured":"Nilli, A.: On the second eigenvalue of a graph. Discret. Math. 91, 207\u2013210 (1991)","journal-title":"Discret. Math."},{"key":"2577_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.37236\/1850","volume":"11","author":"A Nilli","year":"2004","unstructured":"Nilli, A.: Tight estimates for eigenvalues of regular graphs. Electron. J. Combin. 11, 1 (2004)","journal-title":"Electron. J. Combin."},{"key":"2577_CR10","doi-asserted-by":"publisher","first-page":"105579","DOI":"10.1016\/j.jcta.2021.105579","volume":"188","author":"W Sawin","year":"2022","unstructured":"Sawin, W.: An improved lower bound for multicolor Ramsey numbers and the half-multiplicity Ramsey number problem. J. Combin. Theory Ser. A. 188, 105579 (2022)","journal-title":"J. Combin. Theory Ser. A."},{"key":"2577_CR11","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0012-365X(00)00214-4","volume":"229","author":"M Simonovits","year":"2001","unstructured":"Simonovits, M., S\u00f3s, V.: Ramsey\u2013Tur\u00e1n theory. Discret. Math. 229, 293\u2013340 (2001)","journal-title":"Discret. Math."},{"key":"2577_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.37236\/1662","volume":"9","author":"B Sudakov","year":"2002","unstructured":"Sudakov, B.: A note on odd cycle-complete graph Ramsey numbers. Electron. J. Combin. 9, 1 (2002)","journal-title":"Electron. J. Combin."},{"key":"2577_CR13","doi-asserted-by":"publisher","first-page":"2371","DOI":"10.1090\/proc\/15447","volume":"149","author":"Y Wigderson","year":"2021","unstructured":"Wigderson, Y.: An improved lower bound on multicolor Ramsey numbers. Proc. Am. Math. Soc. 149, 2371\u20132374 (2021)","journal-title":"Proc. Am. Math. Soc."},{"key":"2577_CR14","doi-asserted-by":"publisher","first-page":"112823","DOI":"10.1016\/j.disc.2022.112823","volume":"345","author":"Z Xu","year":"2022","unstructured":"Xu, Z., Ge, G.: A note on multicolor Ramsey number of small odd cycles versus a large clique. Discret. Math. 345, 112823 (2022)","journal-title":"Discret. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02577-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02577-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02577-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,9]],"date-time":"2022-12-09T19:28:26Z","timestamp":1670614106000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02577-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,2]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["2577"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02577-w","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2022,11,2]]},"assertion":[{"value":"9 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There are none.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"182"}}