---
res:
  bibo_abstract:
  - The size-Ramsey number r^(H) of a graph H is the smallest number of edges a (host)
    graph G can have, such that for any red/blue colouring of G, there is a monochromatic
    copy of H in G. Recently, Conlon, Nenadov and Trujić showed that if H is a graph
    on n vertices and maximum degree three, then r^(H)=O(n8/5), improving upon the
    upper bound of n5/3+o(1) by Kohayakawa, Rödl, Schacht and Szemerédi. In this paper
    we show that r^(H)≤n3/2+o(1). While the previously used host graphs were vanilla
    binomial random graphs, we prove our result using a novel host graph construction.
    Our bound hits a natural barrier of the existing methods.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Nemanja
      foaf_name: Draganić, Nemanja
      foaf_surname: Draganić
  - foaf_Person:
      foaf_givenName: Kalina H
      foaf_name: Petrova, Kalina H
      foaf_surname: Petrova
      foaf_workInfoHomepage: http://www.librecat.org/personId=554ff4e4-f325-11ee-b0c4-a10dbd523381
  bibo_doi: 10.1112/jlms.70116
  bibo_issue: '3'
  bibo_volume: 111
  dct_date: 2025^xs_gYear
  dct_identifier:
  - UT:001450645400019
  dct_isPartOf:
  - http://id.crossref.org/issn/0024-6107
  - http://id.crossref.org/issn/1469-7750
  dct_language: eng
  dct_publisher: Wiley@
  dct_title: Size‐Ramsey numbers of graphs with maximum degree three@
...