Ramsey Numbers of Connected Clique Matchings

Electronic Journal Of Combinatorics

Barnaby Roberts¹ 

关键词: Graph theory;    Ramsey theory;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

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

【 授权许可】

Others