TY - JOUR
T1 - Anti-Ramsey numbers for vertex-disjoint triangles
AU - Wu, Fangfang
AU - Zhang, Shenggui
AU - Li, Binlong
AU - Xiao, Jimeng
N1 - Publisher Copyright:
© 2022 Elsevier B.V.
PY - 2023/1
Y1 - 2023/1
N2 - An edge-colored graph is called rainbow if all the colors on its edges are distinct. Given a positive integer n and a graph G, the anti-Ramsey number ar(n,G) is the maximum number of colors in an edge-coloring of Kn with no rainbow copy of G. Denote by kC3 the union of k vertex-disjoint copies of C3. In this paper, we determine the anti-Ramsey number ar(n,kC3) for n=3k and n≥2k2−k+2, respectively. When 3k≤n≤2k2−k+2, we give lower and upper bounds for ar(n,kC3).
AB - An edge-colored graph is called rainbow if all the colors on its edges are distinct. Given a positive integer n and a graph G, the anti-Ramsey number ar(n,G) is the maximum number of colors in an edge-coloring of Kn with no rainbow copy of G. Denote by kC3 the union of k vertex-disjoint copies of C3. In this paper, we determine the anti-Ramsey number ar(n,kC3) for n=3k and n≥2k2−k+2, respectively. When 3k≤n≤2k2−k+2, we give lower and upper bounds for ar(n,kC3).
KW - Anti-Ramsey number
KW - Complete graphs
KW - Vertex-disjoint triangles
UR - http://www.scopus.com/inward/record.url?scp=85136074470&partnerID=8YFLogxK
U2 - 10.1016/j.disc.2022.113123
DO - 10.1016/j.disc.2022.113123
M3 - 文章
AN - SCOPUS:85136074470
SN - 0012-365X
VL - 346
JO - Discrete Mathematics
JF - Discrete Mathematics
IS - 1
M1 - 113123
ER -