首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Rainbow Numbers for Cycles with Pendant Edges
Authors:Izolda Gorgol
Institution:(1) Department of Applied Mathematics, Lublin University of Technology, Nadbystrzycka 38D, 20-618 Lublin, Poland
Abstract:A subgraph of an edge-colored graph is called rainbow if all of its edges have different colors. For a graph H and a positive integer n, the anti-Ramsey number f (n, H) is the maximum number of colors in an edge-coloring of K n with no rainbow copy of H. The rainbow number rb(n, H) is the minimum number of colors such that any edge-coloring of K n with rb(n, H) number of colors contains a rainbow copy of H. Certainly rb(n, H) = f(n, H) + 1. Anti-Ramsey numbers were introduced by Erdős et al. 4] and studied in numerous papers. We show that $$rb(n, C_k^+) = rb(n, C_k)$$ for nk + 1, where C k + denotes a cycle C k with a pendant edge.
Keywords:Rainbow number  anti-Ramsey number
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号