---
res:
  bibo_abstract:
  - In 1916, Schur introduced the Ramsey number r(3; m), which is the minimum integer
    n > 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.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Jacob
      foaf_name: Fox, Jacob
      foaf_surname: Fox
  - foaf_Person:
      foaf_givenName: János
      foaf_name: Pach, János
      foaf_surname: Pach
      foaf_workInfoHomepage: http://www.librecat.org/personId=E62E3130-B088-11EA-B919-BF823C25FEA4
  - foaf_Person:
      foaf_givenName: Andrew
      foaf_name: Suk, Andrew
      foaf_surname: Suk
  bibo_doi: 10.1007/s00493-021-4530-9
  bibo_issue: '6'
  bibo_volume: 41
  dct_date: 2021^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_subject:
  - Computational Mathematics
  - Discrete Mathematics and Combinatorics
  dct_title: Bounded VC-dimension implies the Schur-Erdős conjecture@
...