{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T18:16:49Z","timestamp":1763662609520},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,6,1]],"date-time":"2006-06-01T00:00:00Z","timestamp":1149120000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2006,6]]},"DOI":"10.1007\/s00373-006-0659-y","type":"journal-article","created":{"date-parts":[[2006,7,5]],"date-time":"2006-07-05T00:06:47Z","timestamp":1152058007000},"page":"283-288","source":"Crossref","is-referenced-by-count":13,"title":["New Lower Bounds on the Multicolor Ramsey Numbers Rr(C2m)"],"prefix":"10.1007","volume":"22","author":[{"given":"Sun","family":"Yongqi","sequence":"first","affiliation":[]},{"given":"Yang","family":"Yuansheng","sequence":"additional","affiliation":[]},{"given":"Xu","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Li","family":"Bingxi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"659_CR1","doi-asserted-by":"crossref","unstructured":"Bondy J.A., Erd\u00f6s P.: Ramsey numbers for cycles in graphs. J. Combin. Theory (Series B) 14, 46\u201354 (1973)","DOI":"10.1016\/S0095-8956(73)80005-X"},{"key":"659_CR2","unstructured":"Bialostocki A., Sch\u00f6nheim J.: Graph Theory and Combinatorics (Academic Press, London, 1984) 29\u201333"},{"key":"659_CR3","doi-asserted-by":"crossref","unstructured":"Clapham C.R.J., Flockhart A., Sheehan J.: Graphs without four-cycles. J. Graph Theory 13, 29\u201347 (1989)","DOI":"10.1002\/jgt.3190130107"},{"key":"659_CR4","doi-asserted-by":"crossref","unstructured":"Chung F.R.K., Graham R.L.: On multicolor Ramsey numbers for complete bipartite graphs. J. Combin. Theory (Series B) 18, 164\u2013169 (1975)","DOI":"10.1016\/0095-8956(75)90043-X"},{"key":"659_CR5","doi-asserted-by":"crossref","unstructured":"Chung F.R.K.: On the Ramsey numbers $N(3,3,\\ldots,3; 2)$ . Discrete Math. 5, 317\u2013321 (1973)","DOI":"10.1016\/0012-365X(73)90125-8"},{"key":"659_CR6","unstructured":"Exoo G.: Constructing Ramsey graphs with a computer. Congressus Numerantium 59, 31\u201336 (1987)"},{"key":"659_CR7","unstructured":"Fettes S., Kramer R.L., Radziszowski S.P.: An upper bound of 62 on the classical Ramsey number R(3,3,3,3). Ars Combinatoria LXXII, 41\u201363 (2004)"},{"key":"659_CR8","doi-asserted-by":"crossref","unstructured":"Faudree R.J., Schelp R.H.: All Ramsey numbers for cycles in graphs. Discrete Math. 8, 313\u2013329 (1974)","DOI":"10.1016\/0012-365X(74)90151-4"},{"key":"659_CR9","doi-asserted-by":"crossref","unstructured":"Faudree R.J., Schelten A., Schiermeyer I.: The Ramsey numbers R(C7,C7,C7). Discussiones Mathematicea Graph Theory 23, 141\u2013158 (2003)","DOI":"10.7151\/dmgt.1191"},{"key":"659_CR10","unstructured":"Greenwood R.E., Gleason A.M.: Combinatorial relations and chromatic graphs. Canadian J. Mathematics. 7, 1\u20137 (1955)"},{"key":"659_CR11","unstructured":"Graham R.L., Rothschild B.L., Spencer J.H.: Ramsey Theory. (John Wiley & Sons, 1990) 145\u2013146"},{"key":"659_CR12","doi-asserted-by":"crossref","unstructured":"Harary F.: Graph Theory (Addison-Wesley, Reading, Mass., 1969)","DOI":"10.21236\/AD0705364"},{"key":"659_CR13","doi-asserted-by":"crossref","unstructured":"Irving R.W.: Generaised Ramsey numbers for small graphs. Discrete Math. 9, 251\u2013264 (1974)","DOI":"10.1016\/0012-365X(74)90008-9"},{"key":"659_CR14","doi-asserted-by":"crossref","unstructured":"Lazebnik F., Woldar A.: New lower bounds on the multicolor Ramsey numbers Rk(C4). J. Combin. Theory (Series B) 79, 172\u2013176 (2000)","DOI":"10.1006\/jctb.2000.1954"},{"key":"659_CR15","unstructured":"Radziszowski S.P.: Small Ramsey numbers. Electronic J. Combinatorics, http:\/\/www.combinatorics.org\/, #R10, 48 p (2004)"},{"key":"659_CR16","unstructured":"Yang Yuansheng, Rowlinson P.: On extremal graphs without four-cycles. Utilitas Mathematica 41, 204\u2013210 (1992)"},{"key":"659_CR17","unstructured":"Yang Yuansheng, Rowlinson P.: On the third Ramsey numbers of graphs with five edges. J. Combin. Math. and Combin. Comput. 11, 213\u2013222 (1992)"},{"key":"659_CR18","unstructured":"Yang Yuansheng, Rowlinson P.: On graphs without 6-cycles and related Ramsey numbers. Utilitas Mathematica 44, 192\u2013196 (1993)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-006-0659-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-006-0659-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-006-0659-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:26Z","timestamp":1559041106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-006-0659-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["659"],"URL":"https:\/\/doi.org\/10.1007\/s00373-006-0659-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6]]}}}