Let $\mathbf{G}=\{G_1,\dots,G_{n-1}\}$ be a collection of not necessarily distinct graphs of order $n$ on the same vertex set $V$. A path $P$ with $V(P)\subseteq V$ is called \emph{rainbow} in $\mathbf{G}$, if there exists an injection $\phi\colon E(P)\to [n-1]$ such that $e\in E(G_{\phi(e)})$ for each $e\in E(P)$. In...
Let $\mathbf{G}=\{G_1,\dots,G_{2n}\}$ be a collection of not necessarily distinct balanced bipartite graphs of order $2n$ with a common bipartition $V=(X,Y)$. A cycle $C$ with $V(C)\subseteq V$ and $|E(C)|\leq 2n$ is called \emph{rainbow} in $\mathbf{G}$, if there exists an injection $\phi\colon E(C)\to [2n]$ such that...
Let $\mathbf{G}=\{G_1,\dots,G_{n}\}$ be a collection of not necessarily distinct $n$-vertex graphs with a common vertex set $V$. A cycle $C$ with $V(C)\subseteq V$ and $|E(C)|\leq n$ is called \emph{rainbow} in $\mathbf{G}$, if there exists an injection $\phi\colon E(C)\to [n]$ such that $e\in E(G_{\phi(e)})$ for each...
