11112223333

Anti-Ramsey problem in generalized Petersen graphs

发布人:日期:2021年06月02日 09:41浏览数:

报告题目:Anti-Ramsey problem in generalized Petersen graphs

报 告 人:刘慧清教授(湖北大学)

报告时间:202163日  9:30-10:30

报告地点:腾讯会议(216628172

报告摘要:

The anti-Ramsey number Ar(G,H), introduced by Erdos, Simonovits and Sos in 1973, is the maximum number of colors in an edge-coloring of G with no rainbow copy of H. In this talk, we will present some results on the anti-Ramsey numbers in generalized Petersen graphs for cycles.

上一条:代数、数论与几何系列学术报告:Homogeneous Finsler Spaces with Positive Curvature

下一条:On the Proximal Point Algorithm

【关闭】 打印    收藏