科研之友
微信
新浪微博
Facebook
分享链接
摘要
The anti-Ramsey number AR(n, G), for a graph G and an integer n >= vertical bar V(G)vertical bar, is defined to be the minimal integer r such that in any edge-colouring of K-n by at least r colours there is a multicoloured copy of G, namely, a copy of G whose edges have distinct colours. In this paper we determine the anti-Ramsey numbers of all graphs having at most four edges.
- 出版日期2015-10
