A Reduction Of The Spectrum Problem For Odd Sun Systems And The Prime Case

JOURNAL OF COMBINATORIAL DESIGNS(2021)

引用 1|浏览8
暂无评分
摘要
A k-cycle with a pendant edge attached to each vertex is called a k-sun. The existence problem for k-sun decompositions of K-v, with k odd, has been solved only when k = 3 or 5. By adapting a method used by Hoffmann, Lindner, and Rodger to reduce the spectrum problem for odd cycle systems of the complete graph, we show that if there is a k-sun system of Kv (k odd) whenever v lies in the range 2kv6k and satisfies the obvious necessary conditions, then such a system exists for every admissible v >= 6k. Furthermore, we give a complete solution whenever k is an odd prime.
更多
查看译文
关键词
crown graph, cycle systems, graph decompositions, partial mixed differences, sun systems
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要