Rainbow matchings in Dirac bipartite graphs
Abstract
We show the existence of rainbow perfect matchings in μ n-bounded edge colourings 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.