A note on rainbow matchings in properly edge-coloured graphs
Combinatorics
2011-08-29 v1
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 with has a rainbow matching of size , improving a result of Diemunsch et al.
Cite
@article{arxiv.1108.5273,
title = {A note on rainbow matchings in properly edge-coloured graphs},
author = {Allan Lo},
journal= {arXiv preprint arXiv:1108.5273},
year = {2011}
}