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

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

To access the full text documents, please follow this link: http://hdl.handle.net/2117/111531

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtiques
dc.contributor	Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.contributor.author	Cano Vila, María del Pilar
dc.contributor.author	Perarnau Llobet, Guillem
dc.contributor.author	Serra Albó, Oriol
dc.date	2017-08-01
dc.identifier.citation	Cano, M., Perarnau-Llobet, G., Serra, O. Rainbow spanning subgraphs in bounded edge–colourings of graphs with large minimum degree. "Electronic notes in discrete mathematics", 1 Agost 2017, vol. 61, p. 1-7.
dc.identifier.citation	1571-0653
dc.identifier.citation	10.1016/j.endm.2017.06.039
dc.identifier.uri	http://hdl.handle.net/2117/111531
dc.language.iso	eng
dc.relation	http://www.sciencedirect.com/science/article/pii/S1571065317301245?via%3Dihub
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta
dc.subject	Computer science--Mathematics
dc.subject	Probabilistic method
dc.subject	Rainbow subgraphs
dc.subject	Switching techniques
dc.subject	Informàtica--Matemàtica
dc.title	Rainbow spanning subgraphs in bounded edge–colourings of graphs with large minimum degree
dc.type	info:eu-repo/semantics/updatedVersion
dc.type	info:eu-repo/semantics/article
dc.description.abstract	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.

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author