{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T17:05:49Z","timestamp":1774026349477,"version":"3.50.1"},"reference-count":20,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:00:00Z","timestamp":1687737600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2023,11]]},"abstract":"Abstract<\/jats:title>We show that the size-Ramsey number of the \n$\\sqrt{n} \\times \\sqrt{n}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> grid graph is \n$O(n^{5\/4})$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>, improving a previous bound of \n$n^{3\/2 + o(1)}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> by Clemens, Miralaei, Reding, Schacht, and Taraz.<\/jats:p>","DOI":"10.1017\/s0963548323000147","type":"journal-article","created":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T08:55:01Z","timestamp":1687769701000},"page":"874-880","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":3,"title":["On the size-Ramsey number of grids"],"prefix":"10.1017","volume":"32","author":[{"given":"David","family":"Conlon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajko","family":"Nenadov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milo\u0161","family":"Truji\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2023,6,26]]},"reference":[{"key":"S0963548323000147_ref6","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548320000322"},{"key":"S0963548323000147_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF02018930"},{"key":"S0963548323000147_ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2011.01.004"},{"key":"S0963548323000147_ref3","doi-asserted-by":"publisher","DOI":"10.1112\/jlms.12408"},{"key":"S0963548323000147_ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511734885.010"},{"key":"S0963548323000147_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2020.06.004"},{"key":"S0963548323000147_ref15","doi-asserted-by":"publisher","DOI":"10.1137\/20M1335790"},{"key":"S0963548323000147_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90039-4"},{"key":"S0963548323000147_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-72905-8_4"},{"key":"S0963548323000147_ref18","unstructured":"[18] Letzter, S. , Pokrovskiy, A. and Yepremyan, L. (2021) Size-Ramsey numbers of powers of hypergraph trees and long subdivisions. arXiv preprint arXiv: 2103.01942."},{"key":"S0963548323000147_ref19","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s004930070024","article-title":"On size Ramsey numbers of graphs with bounded degree","volume":"20","author":"R\u00f6dl","year":"2000","journal-title":"Combinatorica"},{"key":"S0963548323000147_ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2006.03.004"},{"key":"S0963548323000147_ref20","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20817"},{"key":"S0963548323000147_ref1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190070115"},{"key":"S0963548323000147_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579202"},{"key":"S0963548323000147_ref8","doi-asserted-by":"publisher","DOI":"10.1090\/tran\/8660"},{"key":"S0963548323000147_ref16","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22150"},{"key":"S0963548323000147_ref5","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22432"},{"key":"S0963548323000147_ref14","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300001619"},{"key":"S0963548323000147_ref7","doi-asserted-by":"publisher","DOI":"10.1112\/blms.12682"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548323000147","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,9]],"date-time":"2023-10-09T10:58:23Z","timestamp":1696849103000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548323000147\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,26]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["S0963548323000147"],"URL":"https:\/\/doi.org\/10.1017\/s0963548323000147","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,26]]},"assertion":[{"value":"\u00a9 The Author(s), 2023. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}