The anti-Ramsey number of C3C_{3} and C4C_{4} in the complete rr-partite graphs

preprint2020arXivOpen access

Abstract

A subgraph of an edge-colored graph is rainbow, if all of its edges have different colors. For a graph GG and a family H\mathcal{H} of graphs, the anti-Ramsey number ar(G,H)ar(G, \mathcal{H}) is the maximum number kk such that there exists an edge-coloring of GG with exactly kk colors without rainbow copy of any graph in H\mathcal{H}. In this paper, we study the anti-Ramsey number of C3C_{3} and C4C_{4} in the complete rr-partite graphs. For r≥3r\ge 3 and n1≥n2≥⋯≥nr≥1n_{1}\ge n_{2}\ge \cdots\ge n_{r}\ge 1, we determine ar(Kn1,n2,…,nr,{C3,C4}),ar(Kn1,n2,…,nr,C3) ar(K_{n_{1}, n_{2}, \ldots, n_{r}},\{C_{3}, C_{4}\}), ar(K_{n_{1}, n_{2}, \ldots, n_{r}}, C_{3}) and ar(Kn1,n2,…,nr,C4)ar(K_{n_{1}, n_{2}, \ldots, n_{r}}, C_{4}).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.