Leticia Mattos

Abstract We say that \(G\to (F, H)\) if, in every edge colouring \(c : E(G) \to \{1, 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...