Large Monochromatic Components in Edge Colored Graphs with a Minimum Degree Condition

[摘要] It is well-known that in every $k$-coloring of the edges of the complete graph $K_n$ there is a monochromatic connected component of order at least ${n\over k-1}$. In this paper we study an extension of this problem by replacing complete graphs by graphs

[学科分类] 离散数学和组合数学

[关键词] Ramsey Theory;Monochromatic components