当前位置:
X-MOL 学术
›
Discret. Math.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
The anti-Ramsey numbers of C3 and C4 in complete r-partite graphs
Discrete Mathematics ( IF 0.7 ) Pub Date : 2021-07-26 , DOI: 10.1016/j.disc.2021.112540 Chunqiu Fang 1 , Ervin Győri 2 , Binlong Li 3, 4 , Jimeng Xiao 3, 4
中文翻译:
完全 r 分图中 C3 和 C4 的反拉姆齐数
更新日期:2021-07-26
Discrete Mathematics ( IF 0.7 ) Pub Date : 2021-07-26 , DOI: 10.1016/j.disc.2021.112540 Chunqiu Fang 1 , Ervin Győri 2 , Binlong Li 3, 4 , Jimeng Xiao 3, 4
Affiliation
A subgraph of an edge-colored graph is rainbow, if all of its edges have different colors. For a graph G and a family of graphs, the anti-Ramsey number is the maximum number k such that there exists an edge-coloring of G with exactly k colors without rainbow copy of any graph in . In this paper, we study the anti-Ramsey numbers of and in complete r-partite graphs. For and , we determine and .
中文翻译:
完全 r 分图中 C3 和 C4 的反拉姆齐数
边色图的子图是彩虹,如果它的所有边都有不同的颜色。对于图G和一个族 图的反拉姆齐数 是最大数k使得存在G的边缘着色恰好具有k种颜色,而没有任何图形的彩虹副本. 在本文中,我们研究了反拉姆齐数 和 在完全r部分图中。为了 和 ,我们确定 和 .