pith. sign in

arxiv: 1711.02916 · v2 · pith:42P2IFIXnew · submitted 2017-11-08 · 🧮 math.CO

Rainbow matchings in Dirac bipartite graphs

classification 🧮 math.CO
keywords graphsrainbowdiracbipartiteboundeddegreeexistencematchings
0
0 comments X
read the original abstract

We show the existence of rainbow perfect matchings in $\mu n$-bounded edge colourings of Dirac bipartite graphs, for a sufficiently small $\mu>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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.