<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>article</genre>

<titleInfo><title>Ramsey numbers of books and quasirandomness</title></titleInfo>


<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">David</namePart>
  <namePart type="family">Conlon</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Jacob</namePart>
  <namePart type="family">Fox</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Yuval</namePart>
  <namePart type="family">Wigderson</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">2d0023a0-1567-11f0-833d-d5c1e476d4b5</identifier></name>














<abstract lang="eng">The book graph B
(k)
n consists of n copies of Kk+1 joined along a common Kk. The Ramsey
numbers of B
(k)
n are known to have strong connections to the classical Ramsey numbers
of cliques. Recently, the first author determined the asymptotic order of these Ramsey
numbers for fixed k, thus answering an old question of Erd˝os, Faudree, Rousseau, and
Schelp. In this paper, we first provide a simpler proof of this theorem. Next, answering a
question of the first author, we present a different proof that avoids the use of Szemer´edi’s
regularity lemma, thus providing much tighter control on the error term. Finally, we prove
a conjecture of Nikiforov, Rousseau, and Schelp by showing that all extremal colorings for
this Ramsey problem are quasirandom</abstract>

<originInfo><publisher>Springer Nature</publisher><dateIssued encoding="w3cdtf">2022</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Combinatorica</title></titleInfo>
  <identifier type="issn">0209-9683</identifier>
  <identifier type="eIssn">1439-6912</identifier>
  <identifier type="arXiv">2001.00407</identifier><identifier type="doi">10.1007/s00493-021-4409-9</identifier>
<part><detail type="volume"><number>42</number></detail><detail type="issue"><number>3</number></detail><extent unit="pages">309-363</extent>
</part>
</relatedItem>

<note type="extern">yes</note>
<extension>
<bibliographicCitation>
<ista>Conlon D, Fox J, Wigderson Y. 2022. Ramsey numbers of books and quasirandomness. Combinatorica. 42(3), 309–363.</ista>
<chicago>Conlon, David, Jacob Fox, and Yuval Wigderson. “Ramsey Numbers of Books and Quasirandomness.” &lt;i&gt;Combinatorica&lt;/i&gt;. Springer Nature, 2022. &lt;a href=&quot;https://doi.org/10.1007/s00493-021-4409-9&quot;&gt;https://doi.org/10.1007/s00493-021-4409-9&lt;/a&gt;.</chicago>
<ieee>D. Conlon, J. Fox, and Y. Wigderson, “Ramsey numbers of books and quasirandomness,” &lt;i&gt;Combinatorica&lt;/i&gt;, vol. 42, no. 3. Springer Nature, pp. 309–363, 2022.</ieee>
<mla>Conlon, David, et al. “Ramsey Numbers of Books and Quasirandomness.” &lt;i&gt;Combinatorica&lt;/i&gt;, vol. 42, no. 3, Springer Nature, 2022, pp. 309–63, doi:&lt;a href=&quot;https://doi.org/10.1007/s00493-021-4409-9&quot;&gt;10.1007/s00493-021-4409-9&lt;/a&gt;.</mla>
<short>D. Conlon, J. Fox, Y. Wigderson, Combinatorica 42 (2022) 309–363.</short>
<apa>Conlon, D., Fox, J., &amp;#38; Wigderson, Y. (2022). Ramsey numbers of books and quasirandomness. &lt;i&gt;Combinatorica&lt;/i&gt;. Springer Nature. &lt;a href=&quot;https://doi.org/10.1007/s00493-021-4409-9&quot;&gt;https://doi.org/10.1007/s00493-021-4409-9&lt;/a&gt;</apa>
<ama>Conlon D, Fox J, Wigderson Y. Ramsey numbers of books and quasirandomness. &lt;i&gt;Combinatorica&lt;/i&gt;. 2022;42(3):309-363. doi:&lt;a href=&quot;https://doi.org/10.1007/s00493-021-4409-9&quot;&gt;10.1007/s00493-021-4409-9&lt;/a&gt;</ama>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>22174</recordIdentifier><recordCreationDate encoding="w3cdtf">2026-06-29T10:57:27Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-07-14T08:57:12Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
