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

View/Open
Cita com:
hdl:2117/111531
Document typeArticle
Defense date2017-08-01
Rights accessOpen Access
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.
CitationCano, 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.
ISSN1571-0653
Files | Description | Size | Format | View |
---|---|---|---|---|
journal_rainbow.pdf | 296,7Kb | View/Open |
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain