Ramsey Numbers of Connected Clique Matchings

[摘要] We determine the Ramsey number of a connected clique matching. That is, we show that if $G$ is a $2$-edge-coloured complete graph on $(r^2-r-1)n-r+1$ vertices, then there is a monochromatic connected subgraph containing $n$ disjoint copies of $K_r$, and t

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

[关键词] Graph theory;Ramsey theory