The Ramsey numbers of trees versus \(W_{6}\) or \(W_{7}\) (Q2368712)

The Ramsey number \(R(H_1,H_2)\) is the smallest positive integer \(n\) such that for any graph \(G\) of order \(n\) either \(G\) contains \(H_1\) or its complement \(\overline{G}\) contains \(H_2\). The symbol \(T_n\) stands for a tree of order \(n\) and \(S_n(l,m)\) is used for the tree of order \(n\) obtained from the star \(S_{n-l\times m}\) by subdividing each of \(l\) chosen edges \(m\) times. It is shown that for \(n\geq 5\) the exact value of \(R(T_n,W_6)\) is \(2n-1+\mu\) where \(\mu=2\) if \(T_n=S_n\); \(\mu=1\) if \(T_n=S_n(1,1)\) or \(T_n=S_n(1,2)\) and \(n\equiv 0\; (\text{mod}\; 3)\); and \(\mu=0\) otherwise. For \(n\geq 6\) it is proved that \(R(T_n,W_7)=3n-2\).