The anti-Ramsey problem for independent triangles in tripartite graphs
摘要
An edge colored graph is a rainbow if all colors on its edges are distinct. For two graphs G and H, where G contains H as a subgraph, the anti-Ramsey number of H in G, denoted by AR(G, H), is the largest integer k such that there exists a k-edge-coloring of G containing no rainbow H. Let kC3 denote the union of k independent triangles. The anti-Ramsey problem for cycles (including independent cycles) in a complete graph Kn has been studied well. We consider the problem for independent cycles in a tripartite graph and obtain the value of