Abstract
A subgraph of an edge-colored graph is rainbow, if all of its edges have different colors. For a graph and a family of graphs, the anti-Ramsey number is the maximum number such that there exists an edge-coloring of with exactly colors without rainbow copy of any graph in . In this paper, we study the anti-Ramsey number of and in the complete -partite graphs. For and , we determine and .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.