---
res:
  bibo_abstract:
  - 'The size Ramsey number of a graph H is defined as the minimum number of edges
    in a graph G such that there is a monochromatic copy of H in every two-coloring
    of E(G). The size Ramsey number was introduced by Erdős, Faudree, Rousseau, and
    Schelp in 1978 and they ended their foundational paper by asking whether one can
    determine up to a constant factor the size Ramsey numbers of three families of
    graphs: complete bipartite graphs, book graphs (obtained by adding many common
    neighbors to the vertices of a clique), and starburst graphs (obtained by adding
    many pendant edges to each vertex of a clique). In this paper, we completely resolve
    the latter two questions and make substantial progress on the first by determining
    the size Ramsey number of Ks,t up to a constant factor for all t=Ω(s log s).@eng'
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: David
      foaf_name: Conlon, David
      foaf_surname: Conlon
  - foaf_Person:
      foaf_givenName: Jacob
      foaf_name: Fox, Jacob
      foaf_surname: Fox
  - foaf_Person:
      foaf_givenName: Yuval
      foaf_name: Wigderson, Yuval
      foaf_surname: Wigderson
      foaf_workInfoHomepage: http://www.librecat.org/personId=2d0023a0-1567-11f0-833d-d5c1e476d4b5
  bibo_doi: 10.1007/s00493-023-00034-7
  bibo_issue: '4'
  bibo_volume: 43
  dct_date: 2023^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0209-9683
  - http://id.crossref.org/issn/1439-6912
  dct_language: eng
  dct_publisher: Springer Nature@
  dct_title: Three early problems on size Ramsey numbers@
...