共 50 条
Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs
被引:2
|作者:
Pei, Yifan
[1
]
Lan, Yongxin
[1
]
He, Hua
[1
]
机构:
[1] Hebei Univ Technol, Sch Sci, Tianjin 300401, Peoples R China
基金:
中国国家自然科学基金;
关键词:
Anti-Ramsey number;
Outer-planar graph;
Matching;
RAINBOW NUMBERS;
D O I:
10.1016/j.amc.2021.126843
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
Let O-n be the set of all maximal outer-planar graphs of order n . Let ar(O-n, F ) denote the maximum positive integer k such that there is a k-edge-coloring of a graph T in the family O-n which has no rainbow subgraph F . Denote by M-k a matching of size k . In this paper, we prove that ar(O-n, M-k) <= n + 4k- 9 for n >= 3 k - 3 , which expressively improves the existing upper bound for ar(O-n,M-k). We also prove that ar(O-n,M-5) = n + 4 for all n >= 15 . (c) 2021 Elsevier Inc. All rights reserved.
引用
收藏
页数:5
相关论文