TY - JOUR
AB - 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.
AU - Liebenau, Anita
AU - Mattos, LetĂcia
AU - Mendonca Dos Santos, Walner
AU - Skokan, Jozef
ID - 11706
JF - Random Structures and Algorithms
SN - 1042-9832
TI - Asymmetric Ramsey properties of random graphs involving cliques and cycles
ER -