{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:01:53Z","timestamp":1748404913115,"version":"3.41.0"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T00:00:00Z","timestamp":1737590400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T00:00:00Z","timestamp":1737590400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100010903","name":"Key Programme","doi-asserted-by":"publisher","award":["12331012,12471323"],"award-info":[{"award-number":["12331012,12471323"]}],"id":[{"id":"10.13039\/501100010903","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":[[2025,2]]},"DOI":"10.1007\/s00373-025-02892-y","type":"journal-article","created":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T17:13:55Z","timestamp":1737652435000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Ramsey Numbers of Complete Bipartite Graphs"],"prefix":"10.1007","volume":"41","author":[{"given":"Meng","family":"Liu","sequence":"first","affiliation":[]},{"given":"Bangwei","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,23]]},"reference":[{"key":"2892_CR1","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1017\/S0963548322000360","volume":"32","author":"D Conlon","year":"2023","unstructured":"Conlon, D., Fox, J., Wigderson, Y.: Off-diagonal book ramsey numbers. Combin. Probab. Comput. 32, 516\u2013545 (2023)","journal-title":"Combin. Probab. Comput."},{"key":"2892_CR2","first-page":"217","volume":"4","author":"S Burr","year":"1973","unstructured":"Burr, S., Roberts, J.: On Ramsey Numbers for Stars. Util. Math. 4, 217\u2013220 (1973)","journal-title":"Util. Math."},{"key":"2892_CR3","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/0095-8956(75)90043-X","volume":"18","author":"F Chung","year":"1975","unstructured":"Chung, F., Graham, R.: On Multicolor Ramsey Numbers for Complete Bipartite Graphs. J. Combin. Theory Ser. B 18, 164\u2013169 (1975)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2892_CR4","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1016\/j.ejc.2010.05.002","volume":"31","author":"L Dong","year":"2010","unstructured":"Dong, L., Li, Y.: A Construction for Ramsey Numbers for $$K_{m, n}$$. European J. Combin. 31, 1667\u20131670 (2010)","journal-title":"European J. Combin."},{"key":"2892_CR5","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.disc.2005.01.008","volume":"300","author":"Y Li","year":"2005","unstructured":"Li, Y., Tang, X., Zang, W.: Ramsey functions involving $$K_{m, n}$$ with $$n$$ large. Discrete Math. 300, 120\u2013128 (2005)","journal-title":"Discrete Math."},{"key":"2892_CR6","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1002\/jgt.10118","volume":"43","author":"R Lortz","year":"2003","unstructured":"Lortz, R., Mengersen, I.: Off-Diagonal and Asymptotic Results on the Ramsey Number $$r(K_{2, m}, K_{2, n})$$. J. Graph Theory 43, 252\u2013268 (2003)","journal-title":"J. Graph Theory"},{"key":"2892_CR7","volume-title":"Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"S Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Rucinski, A.: Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York (2000)"},{"key":"2892_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1017\/S0963548300001814","volume":"5","author":"Z F\u00fcredi","year":"1996","unstructured":"F\u00fcredi, Z.: An upper bound on Zarankiewicz\u2019 problem. Combin. Probab. Comput. 5, 29\u201333 (1996)","journal-title":"Combin. Probab. Comput."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02892-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02892-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02892-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T04:22:49Z","timestamp":1748319769000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02892-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,23]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2892"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02892-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,1,23]]},"assertion":[{"value":"3 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"There are none.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"30"}}