Author:
KOSTOCHKA ALEXANDR,YANCEY MATTHEW
Abstract
Arainbow subgraphof an edge-coloured graph is a subgraph whose edges have distinct colours. Thecolour degreeof a vertexvis the number of different colours on edges incident withv. Wang and Li conjectured that fork≥ 4, every edge-coloured graph with minimum colour degreekcontains a rainbow matching of size at least ⌈k/2⌉. A properly edge-colouredK4has no such matching, which motivates the restrictionk≥ 4, but Li and Xu proved the conjecture for all other properly coloured complete graphs. LeSaulnier, Stocker, Wenger and West showed that a rainbow matching of size ⌊k/2⌋ is guaranteed to exist, and they proved several sufficient conditions for a matching of size ⌈k/2⌉. We prove the conjecture in full.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference5 articles.
1. [4] Li X. and Xu Z. (2007) On the existence of a rainbow 1-factor in proper coloring of Krn (r). arXiv:0711.2847 [math.CO].
2. Color degree and heterochromatic matchings in edge-colored bipartite graphs;Li;Util. Math.,2008
3. Heterochromatic matchings in edge-colored graphs;Wang;Electron. J. Combin.,2008
4. Monochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A Survey
5. Rainbow matching in edge-colored graphs;LeSaulnier;Electron. J. Combin.,2010
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献