---
res:
  bibo_abstract:
  - Given a graph , its Ramsey number  is the minimum  so that every two‐coloring
    of  contains a monochromatic copy of . It was conjectured by Conlon, Fox, and
    Sudakov that if one deletes a single vertex from , the Ramsey number can change
    by at most a constant factor. We disprove this conjecture, exhibiting an infinite
    family of graphs such that deleting a single vertex from each decreases the Ramsey
    number by a super‐constant factor. One consequence of this result is the following.
    There exists a family of graphs  so that in any Ramsey coloring for  (i.e., a
    coloring of a clique on  vertices with no monochromatic copy of ), one of the
    color classes has density .@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.1002/jgt.23093
  bibo_issue: '3'
  bibo_volume: 106
  dct_date: 2024^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0364-9024
  - http://id.crossref.org/issn/1097-0118
  dct_language: eng
  dct_publisher: Wiley@
  dct_title: Ramsey numbers upon vertex deletion@
...