An Anti-Ramsey Theorem on Diamonds

作者：Montellano Ballesteros J J^*

来源：Graphs and Combinatorics, 2010, 26(2): 283-291.

DOI：10.1007/s00373-010-0902-4

• Edge-colorings
• Anti-Ramsey
• Totally multicolored
• Turan numbers

Let G be the diamond (the graph obtained from K(4) by deleting an edge) and, for every n >= 4, let f (n, G) be the minimum integer k such that, for every edge-coloring of the complete graph of order n which uses exactly k colors, there is at least one copy of G all whose edges have different colors. Let ext(n, {C(3), C(4)}) be the maximum number of edges of a graph on n vertices free of triangles and squares. Here we prove that for every n >= 4,
ext(n, {C(3), C(4)}) + 2 <= f (n, G) <= ext(n, {C(3), C(4)}) + (n + 1).

• 出版日期2010-3