Anti-Ramsey coloring for matchings in complete bipartite graphs

作者：Jin, Zemin^*; Zang, Yuping

来源：Journal of Combinatorial Optimization, 2017, 33(1): 1-12.

DOI：10.1007/s10878-015-9926-2

• Anti-Ramsey number
• Matching
• Rainbow

The anti-Ramsey number AR(G, H) is defined to be the maximum number of colors in an edge coloring of G which doesn't contain any rainbow subgraphs isomorphic to H. It is clear that there is an AR(K-m,K- n, kK(2))-edge-coloring of K-m,K- n that doesn't contain any rainbow kk(2) . In this paper, we show the uniqueness of this kind of AR(K-m,K- n, kK(2))-edge-coloring of .

• 出版日期2017-1
• 单位浙江师范大学