• Medientyp: E-Artikel
  • Titel: On the size-Ramsey number of grids
  • Beteiligte: Conlon, David; Nenadov, Rajko; Trujić, Miloš
  • Erschienen: Cambridge University Press (CUP), 2023
  • Erschienen in: Combinatorics, Probability and Computing, 32 (2023) 6, Seite 874-880
  • Sprache: Englisch
  • DOI: 10.1017/s0963548323000147
  • ISSN: 0963-5483; 1469-2163
  • Schlagwörter: Applied Mathematics ; Computational Theory and Mathematics ; Statistics and Probability ; Theoretical Computer Science
  • Entstehung:
  • Anmerkungen:
  • Beschreibung: <jats:title>Abstract</jats:title><jats:p>We show that the size-Ramsey number of the <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="png" xlink:href="S0963548323000147_inline1.png" /><jats:tex-math> $\sqrt{n} \times \sqrt{n}$ </jats:tex-math></jats:alternatives></jats:inline-formula> grid graph is <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="png" xlink:href="S0963548323000147_inline2.png" /><jats:tex-math> $O(n^{5/4})$ </jats:tex-math></jats:alternatives></jats:inline-formula>, improving a previous bound of <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="png" xlink:href="S0963548323000147_inline3.png" /><jats:tex-math> $n^{3/2 + o(1)}$ </jats:tex-math></jats:alternatives></jats:inline-formula> by Clemens, Miralaei, Reding, Schacht, and Taraz.</jats:p>