{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:16:09Z","timestamp":1740104169601,"version":"3.37.3"},"reference-count":19,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2013,11,22]],"date-time":"2013-11-22T00:00:00Z","timestamp":1385078400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["0969092"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1300138"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSA","award":["H98230-13-1-0224"]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[2014,9]]},"abstract":"Abstract<\/jats:title>Let be graphs. The multicolor Ramsey number is the minimum integer r<\/jats:italic> such that in every edge\u2010coloring of by k<\/jats:italic> colors, there is a monochromatic copy of in color i<\/jats:italic> for some . In this paper, we investigate the multicolor Ramsey number , determining the asymptotic behavior up to a polylogarithmic factor for almost all ranges of t<\/jats:italic> and m<\/jats:italic>. Several different constructions are used for the lower bounds, including the random graph and explicit graphs built from finite fields. A technique of Alon and R\u00f6dl using the probabilistic method and spectral arguments is employed to supply tight lower bounds. A sample result is\n\nurn:x-wiley:03649024:media:jgt21771:jgt21771-math-0007<\/jats:alt-text><\/jats:graphic><\/jats:disp-formula>for any t<\/jats:italic> and m<\/jats:italic>, where c<\/jats:italic>1<\/jats:sub> and c<\/jats:italic>2<\/jats:sub> are absolute constants.<\/jats:p>","DOI":"10.1002\/jgt.21771","type":"journal-article","created":{"date-parts":[[2013,11,24]],"date-time":"2013-11-24T16:02:21Z","timestamp":1385308941000},"page":"19-38","source":"Crossref","is-referenced-by-count":5,"title":["Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs"],"prefix":"10.1002","volume":"77","author":[{"given":"John","family":"Lenz","sequence":"first","affiliation":[{"name":"DEPARTMENT OF MATHEMATICS, STATISTICS, AND COMPUTER SCIENCE UNIVERSITY OF ILLINOIS AT CHICAGO CHICAGO ILLINOIS"}]},{"given":"Dhruv","family":"Mubayi","sequence":"additional","affiliation":[{"name":"DEPARTMENT OF MATHEMATICS, STATISTICS, AND COMPUTER SCIENCE UNIVERSITY OF ILLINOIS AT CHICAGO CHICAGO ILLINOIS"}]}],"member":"311","published-online":{"date-parts":[[2013,11,22]]},"reference":[{"key":"e_1_2_7_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(80)90030-8"},{"key":"e_1_2_7_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-005-0011-9"},{"volume-title":"The Probabilistic Method, Wiley\u2010Interscience Series in Discrete Mathematics and Optimization","year":"2008","author":"Alon N.","key":"e_1_2_7_4_1"},{"key":"e_1_2_7_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1999.1948"},{"key":"e_1_2_7_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00222-010-0247-x"},{"key":"e_1_2_7_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068"},{"key":"e_1_2_7_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00399-4"},{"key":"e_1_2_7_9_1","unstructured":"P.Erd\u0151s Extremal problems in number theory combinatorics and geometry Proceedings of the International Congress of Mathematicians Vol. 1 2 (Warsaw 1983) PWN Warsaw1984 pp.51\u201370."},{"key":"e_1_2_7_10_1","unstructured":"P.Erd\u0151sandV. T.S\u00f3s Problems and results on Ramsey\u2010Tur\u00e1n type theorems (preliminary report) Proceedings of the West Coast Conference on Combinatorics Graph Theory and Computing (Humboldt State Univ. Arcata Calif. 1979) Utilitas Math. Winnipeg Man. 1980 pp. 17\u201323 Congress. Numer. XXVI."},{"key":"e_1_2_7_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90149-C"},{"key":"e_1_2_7_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1996.0067"},{"key":"e_1_2_7_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-010-0959-0"},{"key":"e_1_2_7_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240070302"},{"key":"e_1_2_7_15_1","doi-asserted-by":"publisher","DOI":"10.4064\/cm-3-1-50-57"},{"key":"e_1_2_7_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240070204"},{"key":"e_1_2_7_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/aama.2001.0794"},{"key":"e_1_2_7_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.10.018"},{"key":"e_1_2_7_19_1","doi-asserted-by":"crossref","unstructured":"F. P.Ramsey On a problem of formal logic Proceedings of the London Mathematical Society s2\u2013s30(1)(1930) 264\u2013286.","DOI":"10.1112\/plms\/s2-30.1.264"},{"key":"e_1_2_7_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00482-9"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.21771","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.21771","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T14:16:46Z","timestamp":1696342606000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.21771"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,22]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["10.1002\/jgt.21771"],"URL":"https:\/\/doi.org\/10.1002\/jgt.21771","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"type":"print","value":"0364-9024"},{"type":"electronic","value":"1097-0118"}],"subject":[],"published":{"date-parts":[[2013,11,22]]}}}