A note on the monotonicity of mixed Ramsey numbers

Discrete Mathematics(2011)

引用 2|浏览4
暂无评分
摘要
For two graphs, G and H, an edge coloring of a complete graph is (G,H)-good if there is no monochromatic subgraph isomorphic to G and no rainbow subgraph isomorphic to H in this coloring. The set of numbers of colors used by (G,H)-good colorings of K\"n is called a mixed Ramsey spectrum. This note addresses a fundamental question of whether the spectrum is an interval. It is shown that the answer is ''yes'' if G is not a star and H does not contain a pendant edge.
更多
查看译文
关键词
totally multicolored,edge coloring,monochromatic,mixed ramsey,gallai colorings,ramsey number,spectrum,complete graph
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要