Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree

We study the existence of rainbow perfect matching and rainbow Hamiltonian cycles in edge-colored graphs where every color appears a bounded number of times. We derive asymptotically tight bounds on the minimum degree of the host graph for the existence of such rainbow spanning structures. The proof uses a probabilisitic argument combined with switching techniques.