---
res:
  bibo_abstract:
  - "The Ramsey number r(G,H) is the minimum N such that every graph on N vertices
    contains G as a subgraph or its complement contains H as a subgraph. For integers
    n≥k≥1, the k-book Bk,n is the graph on n vertices consisting of a copy of Kk,
    called the spine, as well as n−k additional vertices each adjacent to every vertex
    of the spine and non-adjacent to each other. A connected graph H on n vertices
    is called p-good if r(Kp,H)=(p−1)(n−1)+1. Nikiforov and Rousseau proved that if
    n is sufficiently large in terms of p and k, then Bk,n is p-good. Their proof
    uses Szemerédi's regularity lemma and gives a tower-type bound on n. We give a
    short new proof that avoids using the regularity method and shows that every Bk,n
    with n≥2k10p is p-good.\r\nUsing Szemerédi's regularity lemma, Nikiforov and Rousseau
    also proved much more general goodness-type results, proving a tight bound on
    r(G,H) for several families of sparse graphs G and H as long as |V(G)|<δ|V(H)|
    for a small constant δ>0. Using our techniques, we prove a new result of this
    type, showing that r(G,H)=(p−1)(n−1)+1 when H=Bk,n and G is a complete p-partite
    graph whose first p−1 parts have constant size and whose last part has size δn,
    for some small constant δ>0. Again, our proof does not use the regularity method,
    and thus yields double-exponential bounds on δ.\r\n@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Jacob
      foaf_name: Fox, Jacob
      foaf_surname: Fox
  - foaf_Person:
      foaf_givenName: Xiaoyu
      foaf_name: He, Xiaoyu
      foaf_surname: He
  - 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.19086/aic.2023.4
  dct_date: 2023^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/2517-5599
  dct_language: eng
  dct_publisher: Alliance of Diamond Open Access Journals@
  dct_title: Ramsey goodness of books revisited@
...