English

Rainbow matchings in Dirac bipartite graphs

Combinatorics 2017-12-15 v2

Abstract

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

Keywords

Cite

@article{arxiv.1711.02916,
  title  = {Rainbow matchings in Dirac bipartite graphs},
  author = {Matthew Coulson and Guillem Perarnau},
  journal= {arXiv preprint arXiv:1711.02916},
  year   = {2017}
}

Comments

20 pages

R2 v1 2026-06-22T22:39:52.401Z