2026-04-17T14:20:37Zhttps://recercat.cat/oai/request

oai:recercat.cat:2117/1115312026-02-04T07:08:38Zcom_2072_1033col_2072_452950

urn:hdl:2117/111531 Rainbow spanning subgraphs in bounded edge–colourings of graphs with large minimum degree Cano Vila, María del Pilar Perarnau Llobet, Guillem Serra Albó, Oriol Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta Computer science--Mathematics Probabilistic method Rainbow subgraphs Switching techniques Informàtica--Matemàtica 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. Postprint (updated version) 2017-08-01 Article http://www.sciencedirect.com/science/article/pii/S1571065317301245?via%3Dihub http://creativecommons.org/licenses/by-nc-nd/3.0/es/ Open Access Attribution-NonCommercial-NoDerivs 3.0 Spain