Asymmetric Ramsey properties of random graphs involving cliques and cycles Liebenau, Anita Mattos, Letícia Mendonca Dos Santos, Walner Skokan, Jozef ddc:510 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. Wiley 2023 info:eu-repo/semantics/article doc-type:article text http://purl.org/coar/resource_type/c_2df8fbb1 https://research-explorer.ista.ac.at/record/11706 https://research-explorer.ista.ac.at/download/11706/14389 Liebenau A, Mattos L, Mendonca dos Santos W, Skokan J. Asymmetric Ramsey properties of random graphs involving cliques and cycles. <i>Random Structures and Algorithms</i>. 2023;62(4):1035-1055. doi:<a href="https://doi.org/10.1002/rsa.21106">10.1002/rsa.21106</a> eng info:eu-repo/semantics/altIdentifier/doi/10.1002/rsa.21106 info:eu-repo/semantics/altIdentifier/issn/1042-9832 info:eu-repo/semantics/altIdentifier/e-issn/1098-2418 info:eu-repo/semantics/altIdentifier/wos/000828530400001 https://creativecommons.org/licenses/by-nc/4.0/ info:eu-repo/semantics/openAccess