Classes of graphs that exclude a tree and a clique and are not vertex Ramsey (Q1375696)

It is shown that if \(k\) is large enough depending on \(r\), \(q\) then the class \(\text{Forb}\bigl(T(k,r),K_q\bigr)\) fails to have the Ramsey property. Here \(K_q\) is the clique on \(q\) vertices and \(T(k,r)\) is the tree with radius \(r\) and with degrees \(k+1\) (except for the leaves).