科研之友
微信
新浪微博
Facebook
分享链接
摘要
A rainbow subgraph in an edge-coloured graph is a subgraph such that its edges have distinct colours. The minimum colour degree of a graph is the smallest number of distinct colours on the edges incident with a vertex over all vertices. Kostochka, Pfender, and Yancey showed that every edge-coloured graph on n vertices with minimum colour degree at least k contains a rainbow matching of size at least k, provided . In this paper, we show that n a parts per thousand yen 4k - 4 is sufficient for k a parts per thousand yen 4.
- 出版日期2014-3
