12 citations · 15 across the 9 of their papers we have counts for
1 paper · 1 filter
Nina Kamcev, Anita Liebenau, David R. Wood +1
A graph G is Ramsey for a graph H if every 2-colouring of the edges of G contains a monochromatic copy of H. We consider the following question: if H has bounded treewidt…