---
res:
  bibo_abstract:
  - We say that (Formula presented.) if, in every edge coloring (Formula presented.),
    we can find either a 1-colored copy of (Formula presented.) or a 2-colored copy
    of (Formula presented.). The well-known states that the threshold for the property
    (Formula presented.) is equal to (Formula presented.), where (Formula presented.)
    is given by (Formula presented.) for any pair of graphs (Formula presented.) and
    (Formula presented.) with (Formula presented.). In this article, we show the 0-statement
    of the Kohayakawa–Kreuter conjecture for every pair of cycles and cliques. @eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Anita
      foaf_name: Liebenau, Anita
      foaf_surname: Liebenau
  - foaf_Person:
      foaf_givenName: Letícia
      foaf_name: Mattos, Letícia
      foaf_surname: Mattos
  - foaf_Person:
      foaf_givenName: Walner
      foaf_name: Mendonca Dos Santos, Walner
      foaf_surname: Mendonca Dos Santos
      foaf_workInfoHomepage: http://www.librecat.org/personId=12c6bd4d-2cd0-11ec-a0da-e28f42f65ebd
  - foaf_Person:
      foaf_givenName: Jozef
      foaf_name: Skokan, Jozef
      foaf_surname: Skokan
  bibo_doi: 10.1002/rsa.21106
  bibo_issue: '4'
  bibo_volume: 62
  dct_date: 2023^xs_gYear
  dct_identifier:
  - UT:000828530400001
  dct_isPartOf:
  - http://id.crossref.org/issn/1042-9832
  - http://id.crossref.org/issn/1098-2418
  dct_language: eng
  dct_publisher: Wiley@
  dct_title: Asymmetric Ramsey properties of random graphs involving cliques and cycles@
...