A note on rainbow matchings in properly edge-coloured graphs
Abstract
A rainbow matching in an edge-coloured graph is a matching such that its edges have distinct colours. We show that every properly edge-coloured graph G with |G| (9δ(G) -5)/2 has a rainbow matching of size δ(G), improving a result of Diemunsch et al.
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.