一类极小连通图的Anti-Ramsey数

Anti-Ramsey Number of a Minimal Graphs

给定一个正整数n和一个图族F。Kn的边染色中使得Kn不含有F中任意一个图的多色图的最大的颜色数为F的Anti-Ramsey数,记作AR(n,F)。本文给出了任意一条边都在三角形中的极小连通图的Anti-Ramsey数。

For given a positive integer n and a family F of graphs, the anti-Ramsey number AR（n, F） denotes the maximum number of colors in an edge-coloring of Knsuch that no subgraph of Knbelonging to F has distinct colors on its edges. The Anti-Ramsey numbers of a special class of graphs are given.