Stability of transversal Hamilton cycles and paths

Yangyang Cheng, Katherine Staden

Given graphs $G_1,\dots ,G_s$ all on a common vertex set and a graph $H$ with $e(H)=s$, a copy of $H$ is \emph{transversal} or \emph{rainbow} if it contains one edge from each $G…