Rainbow matchings in Dirac bipartite graphs

Matthew Coulson; Guillem Perarnau

doi:10.1002/rsa.20835

Rainbow matchings in Dirac bipartite graphs

Matthew Coulson, Guillem Perarnau

Mathematics

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

197 Downloads (Pure)

Abstract

We show the existence of rainbow perfect matchings in μn-bounded edge colorings of Dirac bipartite graphs, for a sufficiently small μ > 0. As an application of our results, we obtain several results on the existence of rainbow k-factors in Dirac graphs and rainbow spanning subgraphs of bounded maximum degree on graphs with large minimum degree.

Original language	English
Pages (from-to)	271-289
Number of pages	19
Journal	Random Structures and Algorithms
Volume	55
Issue number	2
Early online date	15 Jan 2019
DOIs	https://doi.org/10.1002/rsa.20835
Publication status	Published - Sept 2019

Keywords

minimum degree
perfect matching
rainbow subgraphs

Access to Document

10.1002/rsa.20835

Coulson_&_Perarnau_Rainbow_matchings_Random_Structures_and_Algorithms_2018
This is the peer reviewed version of the following article: [FULL CITE], which has been published in final form at [Link to final article using the DOI]. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving.
Accepted author manuscript, 345 KBLicence: Other (please specify with Rights Statement)

Cite this

@article{8d4560faacdf44a1862562e0b89d0f41,

title = "Rainbow matchings in Dirac bipartite graphs",

abstract = "We show the existence of rainbow perfect matchings in μn-bounded edge colorings of Dirac bipartite graphs, for a sufficiently small μ > 0. As an application of our results, we obtain several results on the existence of rainbow k-factors in Dirac graphs and rainbow spanning subgraphs of bounded maximum degree on graphs with large minimum degree.",

keywords = "minimum degree, perfect matching, rainbow subgraphs",

author = "Matthew Coulson and Guillem Perarnau",

year = "2019",

month = sep,

doi = "10.1002/rsa.20835",

language = "English",

volume = "55",

pages = "271--289",

journal = "Random Structures and Algorithms",

issn = "1042-9832",

publisher = "Wiley",

number = "2",

}

TY - JOUR

T1 - Rainbow matchings in Dirac bipartite graphs

AU - Coulson, Matthew

AU - Perarnau, Guillem

PY - 2019/9

Y1 - 2019/9

N2 - We show the existence of rainbow perfect matchings in μn-bounded edge colorings of Dirac bipartite graphs, for a sufficiently small μ > 0. As an application of our results, we obtain several results on the existence of rainbow k-factors in Dirac graphs and rainbow spanning subgraphs of bounded maximum degree on graphs with large minimum degree.

AB - We show the existence of rainbow perfect matchings in μn-bounded edge colorings of Dirac bipartite graphs, for a sufficiently small μ > 0. As an application of our results, we obtain several results on the existence of rainbow k-factors in Dirac graphs and rainbow spanning subgraphs of bounded maximum degree on graphs with large minimum degree.

KW - minimum degree

KW - perfect matching

KW - rainbow subgraphs

UR - http://www.scopus.com/inward/record.url?scp=85060184753&partnerID=8YFLogxK

U2 - 10.1002/rsa.20835

DO - 10.1002/rsa.20835

M3 - Article

SN - 1042-9832

VL - 55

SP - 271

EP - 289

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

IS - 2

ER -

Rainbow matchings in Dirac bipartite graphs

Abstract

Keywords

Access to Document

Fingerprint

Cite this