A note on Ramsey numbers involving large books (Q6117410)

Summary: For graphs \(G\) and \(H\), the Ramsey number \(R(G, H)\) is the minimum integer \(N\) such that any red/blue edge coloring of \(K_N\) contains either a red \(G\) or a blue \(H\). Let \(\chi(G)\) be the chromatic number of \(G\), and \(s(G)\) the minimum size of a color class over all proper vertex colorings of \(G\) with \(\chi(G)\) colors. A connected graph \(H\) is called \(G\)-good if \(R(G,H)= (\chi(G)-1)(|H|-1)+s(G)\). For graphs \(G\) and \(H\), it is shown \(K_p+nH\) is \((K_2+G)\)-\textit{good}, where \(n\) is double-exponential in terms of \(p, |G|, |H|\), and \(K_p+nH\) is \(C_{2m+1}\)-good for \(n\geqslant (100q)^{8q^{3}}\), where \(q=\max\{m, p, |H|\}\). Both proofs are short and avoid using the regularity method.