For graphs $G$ and $H$, let $G \overset{\mathrm{rb}}{\longrightarrow} H$ denote the property that for every proper edge colouring of $G$ there is a rainbow copy of $H$ in $G$. Extending a result of Nenadov, Person, Škorić and Steger [J. Combin. Theory Ser. B 124 (2017),1-38], we determine the threshold for $G(n,p) \overset{\mathrm{rb}}{\longrightarrow} C_\ell$ for cycles $C_\ell$ of any given length $\ell \geq 4$.

If $G$ is a graph and $\vec H$ is an oriented graph, we write $G\to \vec H$ to say that every orientation of the edges of $G$ contains $\vec H$ as a subdigraph. We consider the case in which $G$ is the binomial random graph $G(n,p)$, establishing the threshold $p_{\vec H}=p_{\vec H}(n)$ for the property $G(n,p)\to \vec H$ for the cases in which $\vec H$ is an acyclic orientation of a complete graph or of a cycle.