极大外平面图中树的 Anti-Ramsey 数  

The Anti-Ramsey Number of Trees in Maximal Out-Planar Graph

作　　者：周韦佳 马华玮 

机构地区：[1]浙江师范大学数学科学学院,浙江 金华

出　　处：《应用数学进展》2024年第1期169-175,共7页Advances in Applied Mathematics

摘　　要：对给定的边染色图 G,如果图 G 的每条边颜色都不一样,则称图 G 是彩虹的。Anti-Ramsey 数 AR(K, F ) 是最大的正整数 k,使得图 K 的任意 k-边染色中,图 K 不包含族 F 中任意的 彩虹图。近些年来,图的 anti-Ramsey 数吸引了很多图论学者的关注,其中平面图中图的 anti- Ramsey 数得到了深入的研究。Jiang 和 West 研究了 k 条边的树在完全图上的 anti-Ramsey 数,而 k 条边的树在平面图中的 anti-Ramsey 数的结论不多。在本文中,我们研究了 k 条边的 树在极大外平面图中的 anti-Ramsey 数,得到了它的上下界。Given a edge-colored graph G, if each edge of G is unique in color, then the graph G is a rainbow graph. The Anti-Ramsey number AR(K, F ) is the largest positive integer k such that in any k-edge-colored graph K, the graph K contains no rainbow graph in the family F . In recent years, the anti-Ramsey number of graph has attracted the attention of many scholars, and the anti-Ramsey numbers for graphs in planar graph has been deeply studied. Jiang and West studied the anti-Ramsey number of trees with k edges in complete graph, while few conclusions were drawn on the anti-Ramsey number of trees with k edges in planar graph. In this paper, we study the anti-Ramsey number of trees with k edges in maximal out-planar graph and get its upper and lower bounds.

关 键 词：Anti-Ramsey 数 树 极大外平面图 

分 类 号：O15[理学—数学]