<?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>Bounded VC-dimension implies the Schur-Erdős conjecture</title></titleInfo>


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


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

<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">János</namePart>
  <namePart type="family">Pach</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">E62E3130-B088-11EA-B919-BF823C25FEA4</identifier></name>
<name type="personal">
  <namePart type="given">Andrew</namePart>
  <namePart type="family">Suk</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">HeEd</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>








<abstract lang="eng">In 1916, Schur introduced the Ramsey number r(3; m), which is the minimum integer n &gt; 1 such that for any m-coloring of the edges of the complete graph Kn, there is a monochromatic copy of K3. He showed that r(3; m) ≤ O(m!), and a simple construction demonstrates that r(3; m) ≥ 2Ω(m). An old conjecture of Erdős states that r(3; m) = 2Θ(m). In this note, we prove the conjecture for m-colorings with bounded VC-dimension, that is, for m-colorings with the property that the set system induced by the neighborhoods of the vertices with respect to each color class has bounded VC-dimension.</abstract>

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

<subject><topic>Computational Mathematics</topic><topic>Discrete Mathematics and Combinatorics</topic>
</subject>


<relatedItem type="host"><titleInfo><title>Combinatorica</title></titleInfo>
  <identifier type="issn">0209-9683</identifier>
  <identifier type="eIssn">1439-6912</identifier>
  <identifier type="arXiv">1912.02342</identifier><identifier type="doi">10.1007/s00493-021-4530-9</identifier>
<part><detail type="volume"><number>41</number></detail><detail type="issue"><number>6</number></detail><extent unit="pages">803-813</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<short>J. Fox, J. Pach, A. Suk, Combinatorica 41 (2021) 803–813.</short>
<chicago>Fox, Jacob, János Pach, and Andrew Suk. “Bounded VC-Dimension Implies the Schur-Erdős Conjecture.” &lt;i&gt;Combinatorica&lt;/i&gt;. Springer Nature, 2021. &lt;a href=&quot;https://doi.org/10.1007/s00493-021-4530-9&quot;&gt;https://doi.org/10.1007/s00493-021-4530-9&lt;/a&gt;.</chicago>
<ista>Fox J, Pach J, Suk A. 2021. Bounded VC-dimension implies the Schur-Erdős conjecture. Combinatorica. 41(6), 803–813.</ista>
<apa>Fox, J., Pach, J., &amp;#38; Suk, A. (2021). Bounded VC-dimension implies the Schur-Erdős conjecture. &lt;i&gt;Combinatorica&lt;/i&gt;. Springer Nature. &lt;a href=&quot;https://doi.org/10.1007/s00493-021-4530-9&quot;&gt;https://doi.org/10.1007/s00493-021-4530-9&lt;/a&gt;</apa>
<ama>Fox J, Pach J, Suk A. Bounded VC-dimension implies the Schur-Erdős conjecture. &lt;i&gt;Combinatorica&lt;/i&gt;. 2021;41(6):803-813. doi:&lt;a href=&quot;https://doi.org/10.1007/s00493-021-4530-9&quot;&gt;10.1007/s00493-021-4530-9&lt;/a&gt;</ama>
<mla>Fox, Jacob, et al. “Bounded VC-Dimension Implies the Schur-Erdős Conjecture.” &lt;i&gt;Combinatorica&lt;/i&gt;, vol. 41, no. 6, Springer Nature, 2021, pp. 803–13, doi:&lt;a href=&quot;https://doi.org/10.1007/s00493-021-4530-9&quot;&gt;10.1007/s00493-021-4530-9&lt;/a&gt;.</mla>
<ieee>J. Fox, J. Pach, and A. Suk, “Bounded VC-dimension implies the Schur-Erdős conjecture,” &lt;i&gt;Combinatorica&lt;/i&gt;, vol. 41, no. 6. Springer Nature, pp. 803–813, 2021.</ieee>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>15275</recordIdentifier><recordCreationDate encoding="w3cdtf">2024-04-03T07:59:57Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2024-04-09T10:40:08Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
