---
res:
  bibo_abstract:
  - "Extending an earlier conjecture of Erdős, Burr and Rosta conjectured that among
    all two-colorings of the edges of a complete graph, the uniformly random coloring
    asymptotically minimizes the number of monochromatic copies of any fixed graph
    H. This conjecture was disproved independently by Sidorenko and Thomason. The
    first author later found quantitatively stronger counterexamples, using the Turán
    coloring, in which one of the two colors spans a balanced complete multipartite
    graph.\r\nWe prove that the Turán coloring is extremal for an infinite family
    of graphs, and that it is the unique extremal coloring. This yields the first
    determination of the Ramsey multiplicity constant of a graph for which the Burr--Rosta
    conjecture fails.\r\nWe also prove an analogous three-color result. In this case,
    our result is conditional on a certain natural conjecture on the behavior of two-color
    Ramsey numbers.@eng"
  bibo_authorlist:
  - 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.19086/aic.2023.2
  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 multiplicity and the Turán coloring@
...