What is Ramsey-equivalent to a clique?
A graph G is Ramsey for H if every two-colouring of the edges of G contains a monochromatic copy of H. Two graphs H and H' are Ramsey-equivalent if every graph G is Ramsey for H if and only if it is Ramsey for H'. In this paper, we study the problem of determining which graphs are Ramsey-e...
| Main Authors: | , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Elsevier,
2017-01-05T18:50:13Z.
|
| Subjects: | |
| Online Access: | Get fulltext |