---
res:
  bibo_abstract:
  - "A graph G is said to be Ramsey size-linear if r(G, H) = OG(e(H))\r\nfor every
    graph H with no isolated vertices. Erdős, Faudree,\r\nRousseau, and Schelp observed
    that K4 is not Ramsey size-linear,\r\nbut each of its proper subgraphs is, and
    they asked whether there\r\nexist infinitely many such graphs. In this short note,
    we answer\r\nthis question in the affirmative@eng"
  bibo_authorlist:
  - 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.1016/j.ejc.2025.104175
  bibo_volume: 128
  dct_date: 2025^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0195-6698
  dct_language: eng
  dct_publisher: Elsevier@
  dct_title: Infinitely many minimally non-Ramsey size-linear graphs@
...