科研之友
微信
新浪微博
Facebook
分享链接
摘要
Let ?????? and ?????? be two graphs. The maximum integer ??????, for which there exists an edge coloring ??????: ??????(??????) & RARR; {1, 2, ... , ??????} that makes every copy of ?????? has at least two edges with the same color, is the anti-Ramsey number of ?????? with respect to ??????. Mycielski developed an interesting graph transformation that transforms ?????? into the Mycielskian ??????(??????) of ??????. In this paper, we determine the anti-Ramsey number of ??????(????????????) with respect to cycles of length 4, 2 ?????? and 2 ?????? + 1, respectively.
