Ramsey equivalence of KnK_n and Kn+Kn−1K_n+K_{n-1}

preprint2015arXivOpen access

Abstract

We prove that, for n≥4n\geq 4, the graphs KnK_n and Kn+Kn−1K_n+K_{n-1} are Ramsey equivalent. That is, if GG is such that any red-blue colouring of its edges creates a monochromatic KnK_n then it must also possess a monochromatic Kn+Kn−1K_n+K_{n-1}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.