Ramsey equivalence of $K_n$ and $K_n+K_{n-1}$

Electronic Journal Of Combinatorics

Thomas F. Bloom¹ 

关键词: Graph theory;    Ramsey theory;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

We prove that, for $n\geqslant 4$, the graphs $K_n$ and $K_n+K_{n-1}$ are Ramsey equivalent. That is, if $G$ is such that any red-blue colouring of its edges creates a monochromatic $K_n$ then it must also possess a monochromatic $K_n+K_{n-1}$. This resol

【 授权许可】

Others