Ramsey equivalence of $K_n$ and $K_n+K_{n1}$
Abstract
We prove that, for $n\geq 4$, the graphs $K_n$ and $K_n+K_{n1}$ are Ramsey equivalent. That is, if $G$ is such that any redblue colouring of its edges creates a monochromatic $K_n$ then it must also possess a monochromatic $K_n+K_{n1}$.
 Publication:

arXiv eprints
 Pub Date:
 August 2015
 arXiv:
 arXiv:1508.03866
 Bibcode:
 2015arXiv150803866B
 Keywords:

 Mathematics  Combinatorics