Asymmetric Ramsey Properties of Random Graphs for Cliques and Cycles

arXiv2010.11933MaRDI QIDQ6352014FDOQ6352014

Walner Mendonça, J. Skokan, Anita Liebenau, Letícia Mattos

Publication date: 22 October 2020

Abstract: We say that $Go(F,H)$ if, in every edge colouring $c:E(G)o1,2$, we can find either a $1$-coloured copy of $F$ or a $2$-coloured copy of $H$. The well-known Kohayakawa--Kreuter conjecture states that the threshold for the property $G(n,p)o(F,H)$ is equal to $n^{-1/m_2(F,H)}$, where $m_2(F,H)$ is given by [ m_{2}(F,H):= max left{dfrac{e(J)}{v(J)-2+1/m_2(H)} : J subseteq F, e(J)ge 1 ight}. ] In this paper, we show the $0$-statement of the Kohayakawa--Kreuter conjecture for every pair of cycles and cliques.

This page was built for publication: Asymmetric Ramsey Properties of Random Graphs for Cliques and Cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6352014)