2 research outputs found
On an anti-Ramsey problem of Burr, Erdös, Graham and T. Sós
Given a graph L, in this paper we investigate the anti-Ramsey number S (n; e; L), de ned to be the minimum number of colors needed to edge-color some graph G(n; e) with n vertices and e edges so that in every copy of L in G all edges have dierent colors. We call such a copy of L totally multicolored (TMC)