Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
复制标题
完全图中匹配的反拉姆齐问题的极值着色
DOI：
10.1007/s10878-017-0125-1
复制
发表时间：
2017
影响因子：
1
通讯作者：
Zang Yuping
中科院分区：
文献类型：
--
作者：
Zemin Jin;Sun Yuefang;Yan Sherry H F;Zang Yuping
Given a graphG, the anti-Ramsey numberis defined to be the maximum number of colors in an edge-coloring ofwhich does not contain any rainbowG(i.e., all the edges ofGhave distinct colors). The anti-Ramsey number was introduced by Erdős et al. (Infinite and finite sets, pp 657–665, 1973) and so far it has been determined for several special graph classes. Another related interesting problem posed by Erdős et al. is the uniqueness of the extremal coloring for the anti-Ramsey number. Contrary to the anti-Ramsey number, there are few results about the extremal coloring. In this paper, we show the uniqueness of such extremal coloring for the anti-Ramsey number of matchings in the complete graph.
