---
res:
  bibo_abstract:
  - "The book graph B\r\n(k)\r\nn consists of n copies of Kk+1 joined along a common
    Kk. The Ramsey\r\nnumbers of B\r\n(k)\r\nn are known to have strong connections
    to the classical Ramsey numbers\r\nof cliques. Recently, the first author determined
    the asymptotic order of these Ramsey\r\nnumbers for fixed k, thus answering an
    old question of Erd˝os, Faudree, Rousseau, and\r\nSchelp. In this paper, we first
    provide a simpler proof of this theorem. Next, answering a\r\nquestion of the
    first author, we present a different proof that avoids the use of Szemer´edi’s\r\nregularity
    lemma, thus providing much tighter control on the error term. Finally, we prove\r\na
    conjecture of Nikiforov, Rousseau, and Schelp by showing that all extremal colorings
    for\r\nthis Ramsey problem are quasirandom@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-021-4409-9
  bibo_issue: '3'
  bibo_volume: 42
  dct_date: 2022^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: Ramsey numbers of books and quasirandomness@
...